Abstract
With each eigenspace of the adjacency matrix A of a graph X there is an associated convex polytope. Any automorphism of X induces an orthogonal transformation of this polytope onto itself. These observations are used to obtain information on the relation between the automorphism group of X and the multiplicities of the eigenvalues of A. This approach yields new results on this topic as well as improvements of previously known ones.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Biggs, N. Algebraic Graph Theory, C.U.P., London, (1974).
Coxeter, H. and Moser, W. Generators and relations for discrete groups, 2nd ed. Springer, Berlin (1965).
Grünbaum, B. Convex Polytopes, Wiley, New York (1967).
Harary, F. "Graph Theory", Addison-Wesley, Reading, Ma., (1969).
Huppert, B., "Endliche Gruppen I", Springer, Berlin, (1967).
Mowshowitz, A. The group of a graph whose adjacency matrix has all distinct eigenvalues, in Proof Techniques in Graph Theory, Academic, New York (1969), 109–110.
Petersdorf, M. and Sachs, H. Spektrum und Automorphismengruppe eines Graphen, in Combinatorial theory and its applications, III, North-Holland, Amsterdam (1970), 891–907.
Wielandt, H. "Finite Permutation Groups", Academic Press, New York, (1964).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Godsil, C.D. (1978). Graphs, groups and polytopes. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062528
Download citation
DOI: https://doi.org/10.1007/BFb0062528
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08953-7
Online ISBN: 978-3-540-35702-5
eBook Packages: Springer Book Archive