Reducing the adjacency matrix of a tree

DOI10.13001/1081-3810.1002MaRDI QIDQ4379574zbMATH OpenOpenAlexFDO

Authors Stephen T. Hedetniemi, David P. Jacobs, 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, http://www.emis.de/journals/ELA/ela-articles/1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

adjacency matrixdeterminanteigenvaluemaximum matchingranktree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1472121
• scientific article; zbMATH DE number 2235064
• Computing the characteristic polynomial of a tree
• The determinant of a tree's neighborhood matrix

Cited in

(19)

• 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
• On the core-nilpotent decomposition of trees
• The determinant of a unicyclic graph's neighborhood matrix
• A typical vertex of a tree
• 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
• Computing the inverse of a tree's incidence matrix
• 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
• Efficient computation of the characteristic polynomial of a tree and related tasks
• The effect on the spectral radius by attaching a pendant starlike tree
• On the number of Laplacian eigenvalues of trees less than the average degree
• Singular distance powers of circuits
• Tree decomposition by eigenvectors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379574)