Advertisement

Journal of Mathematical Chemistry

, Volume 3, Issue 4, pp 403–406 | Cite as

Computing the characteristic polynomial of a tree

  • Bojan Mohar
Notes

Abstract

An algorithm is given for computing the values of the characteristic polynomial of a tree. Its time complexity is linear; hence, the polynomial is readily accessible from the tree and no computation is necessary to get the polynomial ready for applications. If necessary, the coefficients can be determined in time O(n2). This improves the complexity O(n3), reached by Tinhofer and Schreck, to O(1).

Keywords

Physical Chemistry Time Complexity Characteristic Polynomial 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Abo, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Mass., 1974).Google Scholar
  2. [2]
    D. Cvetković, M. Doob and H. Sachs,Spectra of Graphs (Academic Press, New York, 1979).Google Scholar
  3. [3]
    C.D. Godsil and I. Gutman, On the theory of the matching polynomial, J. Graph Theory 5 (1981)137–144.Google Scholar
  4. [4]
    E. Isaacson and H.B. Keller,Analysis ofNumericalMethods (Wiley, New York, 1966).Google Scholar
  5. [5]
    G. Tinhofer and H. Schreck, Computing the characteristic polynomial of a tree, Computing 35 (1985)113–125.Google Scholar

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1989

Authors and Affiliations

  • Bojan Mohar
    • 1
  1. 1.Department of MathematicsUniversity of LjubljanaLjubljanaYugoslavia

Personalised recommendations