Skip to main content
SpringerLink
Log in

Symmetry and eigenvectors

  • Chapter
Book cover Graph Symmetry

Part of the book series: NATO ASI Series ((ASIC,volume 497))

Abstract

We survey some of what can be deduced about automorphisms of a graph from information on its eigenvalues and eigenvectors. Two of the main tools are convex polytopes and a number of matrix algebras that can be associated to the adjacency matrix of a graph.

Support from a Natural Sciences and Engineering Research Council of Canada operating grant is gratefully acknowledged.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Babai, D. Yu. Grigoryev and D. M. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, Proc. 14th ACM STOC (1982), 310–324.

    Google Scholar 

  2. E. Bannai and T. Ito, Algebraic Combinatorics I, Benjamin/Cummings, Menlo Park, CA, 1984.

    MATH  Google Scholar 

  3. N. Biggs, Algebraic Graph Theory, 2nd edition, Cambridge University Press, Cambridge, 1993.

    Google Scholar 

  4. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin, 1989.

    Book  MATH  Google Scholar 

  5. R. A. Brualdi, Some applications of doubly stochastic matrices, Linear Algebra Appl. 107 (1988), 77–100.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. J. Cameron, Automorphism groups of graphs, in: Selected Topics in Graph Theory, Vol. 2 ( L.W. Beineke and R.J. Wilson, eds.), Academic Press, London, 1983, 89–127.

    Google Scholar 

  7. D. G. Corneil and C. C. Gottlieb, An efficient algorithm for graph isomorphism, J. Assoc. Comput. Mach. 17 (1970), 51–64.

    Article  MathSciNet  MATH  Google Scholar 

  8. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl. 10 (1973).

    Google Scholar 

  9. S. Evdokimov, M. Karpinski and I. Ponomarenko, Compact cellular algebras and permutation groups, preprint, 1996.

    Google Scholar 

  10. C. D. Godsil, Graphs, groups and polytopes, in: Combinatorial Mathematics (D. A. Holton and J. Seberry, eds.), Lecture Notes in Math. 686, Springer-Verlag, Berlin, 1978, 157–164.

    Google Scholar 

  11. C. D. Godsil, Algebraic Combinatorics, Chapman and Hall, New York, 1993.

    MATH  Google Scholar 

  12. C. D. Godsil, Equitable partitions, in: Combinatorics, Paul Erdós is Eighty (Vol. 1) ( D. Miklós, V. T. Sós and T. Szónyi, eds.), Janos Bolyai Mathematical Society, Budapest, 1993, 173–192.

    Google Scholar 

  13. C. D. Godsil, Compact graphs and equitable partitions, Linear Algebra Appl.,to appear.

    Google Scholar 

  14. C. D. Godsil, Eigenpolytopes of distance regular graphs, Canad. J. Math.,to appear.

    Google Scholar 

  15. C. D. Godsil and W. J. Martin, Quotients of association schemes, J. Combin. Theory Ser. A 69 (1995), 185–199.

    Article  MathSciNet  MATH  Google Scholar 

  16. C. D. Godsil and B. D. McKay, Feasibility conditions for the existence of walk-regular graphs, Linear Algebra Appl. 30 (1980), 51–61.

    Article  MathSciNet  MATH  Google Scholar 

  17. C. D. Godsil and B. D. McKay, Spectral conditions for the reconstructibility of a graph, J. Combin. Theory Ser. B 30 (1981), 285–289.

    Article  MathSciNet  MATH  Google Scholar 

  18. C. D. Godsil and J. Shawe-Taylor, Distance-regularised graphs are distance-regular or distance biregular, J. Combin. Theory Ser. B 43 (1987), 14–24.

    Article  MathSciNet  MATH  Google Scholar 

  19. D. Gorenstein, Finite Groups, Harper Row, New York, 1968.

    MATH  Google Scholar 

  20. T. J. Laffey, A basis theorem for matrix algebras, Linear and Multilinear Algebra 8 (1980), 183–187.

    Article  MathSciNet  MATH  Google Scholar 

  21. P. Lancaster and M. Tismenetsky, The Theory of Matrices: With Applications, 2nd edition, Academic Press, New York, 1985.

    MATH  Google Scholar 

  22. B. D. McKay, Backtrack Programming and the Graph Isomorphism Problem, M. Sc. Thesis, University of Melbourne, 1976.

    Google Scholar 

  23. E. Mendelsohn, Every (finite) group is the group of automorphisms of a (finite) strongly regular graph, Ars Combin. 6 (1978), 75–86.

    MathSciNet  MATH  Google Scholar 

  24. E. Mendelsohn, On the groups of automorphisms of Steiner triple and quadruple systems, J. Combin. Theory Ser. A 25 (1978), 97–104.

    Article  MathSciNet  MATH  Google Scholar 

  25. A. Moshowitz, Graphs, groups and matrices, in: Proc. 25th Summer Meeting Canad. Math. Congress, Congr. Numer. 4, Utilitas Mathematica, Winnipeg, 1971, 509–522.

    Google Scholar 

  26. M. Petersdorf and H. Sachs, Spektrum und Automorphismengruppe eines Graphen, in: Combinatorial Theory and its Applications, III., North-Holland, Amsterdam, 891–907.

    Google Scholar 

  27. K. Phelps, Latin square graphs and their automorphism groups, Ars Combin. 7 (1979), 273–299.

    MathSciNet  MATH  Google Scholar 

  28. V. V. Prasolov, Problems and Theorems in Linear Algebra, Transl. Math. Monographs 134, Amer. Math. Soc., Providence, RI, 1994.

    Google Scholar 

  29. H. Schreck and G. Tinhofer, A note on certain subpolytopes of the assignment polytope associated with circulant graphs, Linear Algebra Appl. 111 (1988), 125–134.

    Article  MathSciNet  MATH  Google Scholar 

  30. G. Tinhofer, Graph isomorphism and theorems of Birkhoff type, Computing 36 (1986), 285–300.

    Article  MathSciNet  MATH  Google Scholar 

  31. G. Tinhofer, A note on compact graphs, Discrete Appl. Math. 30 (1991), 253–264.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    Ada Chan & Chris D. Godsil

Authors
  1. Ada Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chris D. Godsil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Départment d’Informatique et de Recherche opérationnelle, Université de Montréal, CP 6128, Succ. Centre-ville, H3C 3J7, Montréal, Québec, Canada

    Geňa Hahn

  2. Départment de Mathématiques et de Statistique, Université de Montréal, CP 6128, Succ. Centre-ville, H3C 3J7, Montréal, Québec, Canada

    Gert Sabidussi

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Chan, A., Godsil, C.D. (1997). Symmetry and eigenvectors. In: Hahn, G., Sabidussi, G. (eds) Graph Symmetry. NATO ASI Series, vol 497. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8937-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8937-6_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4885-1

  • Online ISBN: 978-94-015-8937-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation