Skip to main content

Computing the Characteristic polynomial of a graph

Part II: Contributed Papers Expository Review Articles

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

Abstract

How can one actually compute the eigenvalues of a graph? In principal, there are three methods. Namely, (1) we can search for p orthogonal eigenvectors, (2) we can determine the first p moments by counting closed walks and then find the spectrum from the moments, or (3) we can use certain subgraphs to determine the coefficients of the characteristic polynomial and then find its roots.

In practice, however, all of these approaches may prove to be too tedious. If the spectrum is a natural concept, then we should expect to find simple relations between the spectra of related graphs. This is indeed the case. In Sections 2 and 3, we present four theorems which are structural results linking the spectrum of a graph to the spectra of certain subgraphs. Then in Section 4, we find the spectra of graphs formed by certain binary operations. In the final section, we apply these results to obtain the spectra of several known families of graphs: complete graphs, complete bigraphs, cubes, cycles, wheels, paths, ladders, and möbius ladders.

Keywords

  • Planar Graph
  • Adjacency Matrix
  • Characteristic Polynomial
  • Binary Operation
  • Strong Product

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Research supported in part by grant 73-2502 from the Air Force Office of Scientific Research. This paper was part of the author's doctoral dissertation "The Spectrum of a Graph," The University of Michigan, 1973.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Collatz, L., and Sinogowitz, U., "Spectra of finite graphs", Abh. Math. Sem. Univ. Hamburg, 21 (1957) 64–77.

    CrossRef  MathSciNet  Google Scholar 

  2. Cvetković, D. M., "Spectrum of the graph of n-tuples", Publ. Elektrotehn. Fak. Univ. Beograd, Ser. Mat. Fiz., Nos. 274–301 (1969) 91–95.

    Google Scholar 

  3. Cvetković, D. M., "Graphs and their spectra", Publ. Elektrotehn. Fak. Univ. Beograd, Ser. Mat. Fiz., Nos. 354–356 (1971) 1–50.

    Google Scholar 

  4. Doob, M., "Graphs with a small number of distinct eigenvalues", Annals of the New York Academy of Sciences, 175 (1970) 104–110.

    MathSciNet  MATH  Google Scholar 

  5. Harary, F., "The determinant of the adjacency matrix of a graph", SIAM Rev., 4 (1962) 202–210.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Harary, F., Graph Theory. Addison-Wesley, Reading, 1969.

    Google Scholar 

  7. Harary, F., King, C., Mowshowitz, A., and Read, R.C., "Cospectral graphs and digraphs", Bull. London Math. Soc. 3 (1971), 321–328.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Mowshowitz, A., "The adjacency matrix and the group of a graph", New Directions in the Theory of Graphs (F. Harary, ed.). Academic Press, New York, 1973.

    Google Scholar 

  9. Sachs, H., "Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom.", Publ. Math. Debrecen 11 (1964) 119–134.

    MathSciNet  MATH  Google Scholar 

  10. Spialter, L., "The atom connectivity matrix and its characteristic polynomial", J. Chem. Documentation 4 (1964) 261–274.

    CrossRef  Google Scholar 

  11. Zykov, A. A., "On some properties of linear complexes, (Russian). Mat. Sbornik 24 (1949) 163–188. Amer. Math. Soc. Translation N. 79, 1952.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Schwenk, A.J. (1974). Computing the Characteristic polynomial of a graph. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066438

Download citation

  • DOI: https://doi.org/10.1007/BFb0066438

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06854-9

  • Online ISBN: 978-3-540-37809-9

  • eBook Packages: Springer Book Archive