Characteristic vertices of trees*

DOI10.1080/03081088708817827zbMath0633.05022OpenAlexW2050033479MaRDI QIDQ5903500

Russell Merris

Publication date: 1987

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088708817827

zbMATH Keywords

characteristic polynomialchromatic polynomialmatrixcharacteristic verticescharacteristic valuations

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

The algebraic connectivity of graphs with given matching number ⋮ Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1 ⋮ On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs ⋮ About the type of broom trees ⋮ Unnamed Item ⋮ The number of spanning forests of a graph ⋮ A conjecture on the algebraic connectivity of connected graphs with fixed girth ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ A Fiedler-like theory for the perturbed Laplacian ⋮ On a Poset of Trees II

Cites Work

• Unnamed Item
• Schur convex functions on the spectra of graphs
• Permanental roots and the star degree of a graph
• Acyclic orientations of graphs
• The Second Immanantal Polynomial and the Centroid of a Graph
• Algebraic Graph Theory
• A logical expansion in mathematics
• Developments in the theory of graph spectra
• An introduction to chromatic polynomials
• Inequalities: theory of majorization and its applications

This page was built for publication: Characteristic vertices of trees^*