An O(n2) algorithm for the characteristic polynomial of a tree

Electronic Notes in Discrete Mathematics

Volumn 7, Issue , 2001, Pages 86-89

  Jacobs, David P ^a   Machado, Catia M S ^b   Trevisan, Vilmar ^c  

^a AMRL   (United States)

^b FEDERAL UNIVERSITY OF RIO GRANDE   (Brazil)

^c FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Adjacency matrix; Characteristic polynomial; Tree

Indexed keywords

EID: 34247135992     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/s1571-0653(04)00231-8     Document Type: Article

References (6)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. K. Balasubramanian, "Spectra of chemical trees", International Journal of Quantum Chemistry XXI (1982), pp. 581-590.
3. G. H. Fricke, S. T. Hedetniemi, D. P. Jacobs, and V. Trevisan, "Reducing the adjacency matrix of a tree", Eletronic Journal of Linear Algebra 1 (1996), pp. 34-44.
4. D. P. Jacobs and V. Trevisan, The determinant of a tree's neighborhood matrix, Linear Algebra and Its Applications 256 (1997), pp. 235-249.
5. D. P. Jacobs and V. Trevisan, Constructing the characteristic polynomial of a tree's adjacency matrix, Congressus Numerantium 139 (1998), pp. 139-145.
6. J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, London, 1965.