Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-16T17:06:28.068Z Has data issue: false hasContentIssue false

A new graph product and its spectrum

Published online by Cambridge University Press:  17 April 2009

C.D. Godsil
Affiliation:
Department of Mathematics, Syracuse University, Syracuse, New York, USA;
B.D. McKay
Affiliation:
Department of Mathematics, University of Melbourne, Parkville, Victoria.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A new graph product is introduced, and the characteristic polynomial of a graph so–formed is given as a function of the characteristic polynomials of the factor graphs. A class of trees produced using this product is shown to be characterized by spectral properties.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1978

References

[1]Behzad, Mehdi, Chartrand, Gary, Introduction to the theory of graphs (Allyn and Bacon, Boston, 1971).Google Scholar
[2]Godsil, C. and McKay, B., “Some computational results on the spectra of graphs”, Combinatorial Mathematics IV, 7392 (Proc. Fourth Austral. Conf., University of Adelaide, 1975 Lecture Notes in Mathematics, 560. Springer-Verlag, Berlin, Heidelberg, New York, 1976).CrossRefGoogle Scholar
[3]Sachs, Horst, “Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom”, Publ. Math. Debrecen 11 (1964), 119134.CrossRefGoogle Scholar
[4]Schwenk, Allen J., “Computing the characteristic polynomial of a graph”, Graphs and combinatorics, 153172 (Proc. Capital Conf. Graph Theory and Combinatorics, George Washington University, 1973. Lecture Notes in Mathematics, 406. Springer-Verlag, Berlin, Heidelberg, New York, 1974).CrossRefGoogle Scholar