Reducing the adjacency matrix of a tree

DOI10.13001/1081-3810.1002zbMath0886.05048OpenAlexW347286294MaRDI 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

treeeigenvalueadjacency matrixrankdeterminantmaximum matching

Mathematics Subject Classification ID

Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Graph theory (including graph drawing) in computer science (68R10) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (15)

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

This page was built for publication: Reducing the adjacency matrix of a tree