Computing the characteristic polynomial of a tree
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).
KeywordsPhysical Chemistry Time Complexity Characteristic Polynomial
Unable to display preview. Download preview PDF.
- A.V. Abo, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Mass., 1974).Google Scholar
- D. Cvetković, M. Doob and H. Sachs,Spectra of Graphs (Academic Press, New York, 1979).Google Scholar
- C.D. Godsil and I. Gutman, On the theory of the matching polynomial, J. Graph Theory 5 (1981)137–144.Google Scholar
- E. Isaacson and H.B. Keller,Analysis ofNumericalMethods (Wiley, New York, 1966).Google Scholar
- G. Tinhofer and H. Schreck, Computing the characteristic polynomial of a tree, Computing 35 (1985)113–125.Google Scholar