Reducing the adjacency matrix of a tree

DOI10.13001/1081-3810.1002zbMath0886.05048MaRDI QIDQ4379574

David P. Jacobs, Stephen T. Hedetniemi, Vilmar Trevisan, Gerd H. Fricke

Publication date: 8 March 1998

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119300

zbMATH Keywords

tree; eigenvalue; adjacency matrix; rank; determinant; maximum matching

Mathematics Subject Classification ID

05C05: Trees

15A15: Determinants, permanents, traces, other special matrix functions

68R10: Graph theory (including graph drawing) in computer science

15A18: Eigenvalues, singular values, and eigenvectors

Related Items

The Laplacian energy of diameter 4 trees, Efficient computation of the characteristic polynomial of a threshold graph, Efficient computation of the characteristic polynomial of a tree and related tasks, On the number of Laplacian eigenvalues of trees less than the average degree, Singular distance powers of circuits, Tree decomposition by eigenvectors, Two-colorable graph states with maximal Schmidt measure, Inclusion relations of certain graph eigenspaces, Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings, The determinant of a unicyclic graph's neighborhood matrix, A new greedoid: The family of local maximum stable sets of a forest, Linear-time LUP decomposition of forest-like matrices, Laplacian energy of diameter 3 trees, Efficient Computation of the Characteristic Polynomial of a Threshold Graph