The linear complexity of a graph

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-19

  Neel, David L ^a   Orrison, Michael E ^b  

^a SEATTLE UNIVERSITY   (United States)

^b HARVEY MUDD COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31844446075     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1035     Document Type: Review

References (15)

1. O. Bastert, D. Rockmore, P. Stadler, and G. Tinhofer, Landscapes on spaces of trees, Appl. Math. Comput. 131 (2002), no. 2-3, 439-459.
2. N. Biggs, Algebraic graph theory, Cambridge University Press, London, 1974, Cambridge Tracts in Mathematics, No. 67.
3. A. Brouwer, A. Cohen, and A. Neumaier, Distance-regular graphs, Springer-Verlag, Berlin, 1989.
4. P. Bürgisser, M. Clausen, and M.A. Shokrollahi, Algebraic complexity theory, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 315, Springer-Verlag, Berlin, 1997, With the collaboration of Thomas Lickteig.
5. G. Constantine, Graph complexity and the Laplacian matrix in blocked experiments, Linear and Multilinear Algebra 28 (1990), no. 1-2, 49-56.
6. P. Diaconis, Group representations in probability and statistics, Institute of Mathematical Statistics, Hayward, CA, 1988.
7. T. Feder and R. Motwani, Clique partitions, graph compression and speeding-up algorithms, J. Comput. System Sci. 51 (1995), no. 2, 261-272.
8. R. Grone and R. Merris, A bound for the complexity of a simple graph, Discrete Math. 69 (1988), no. 1, 97-99.
9. D. Maslen, M. Orrison, and D. Rockmore, Computing isotypic projections with the Lanczos iteration, SIAM Journal on Matrix Analysis and Applications 25 (2004), no. 3, 784-803.
10. D. Minoli, Combinatorial graph complexity, Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 59 (1975), no. 6, 651-661 (1976).
11. M. Orrison, An eigenspace approach to decomposing representations of finite groups, Ph.D. thesis, Dartmouth College, 2001.
12. P. Pudlák, V. Rödl, and P. Savický, Graph complexity, Acta Inform. 25 (1988), no. 5, 515-535.
13. C. Reidys and P. Stadler, Combinatorial landscapes, SIAM Rev. 44 (2002), no. 1, 3-54.
14. D. Rockmore, P. Kostelec, W. Hordijk, and P. Stadler, Fast Fourier transform for fitness landscapes, Appl. Comput. Harmon. Anal. 12 (2002), no. 1, 57-76.
15. D. West, Introduction to graph theory, Prentice Hall Inc., Upper Saddle River, NJ, 1996.