A minimax-condition for the characteristic center of a tree

DOI10.1080/03081089808818585zbMath0944.05022OpenAlexW2018541612MaRDI QIDQ4942584

Georg Zimmermann

Publication date: 24 September 2000

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

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

zbMATH Keywords

Laplacian matrixcharacteristic center of the treerooted Laplacian

Mathematics Subject Classification ID

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

Cites Work

• Permanental roots and the star degree of a graph
• A generalization of the matrix-tree theorem
• Characteristic vertices of weighted trees via perron values
• Large eigenvalues of the laplacian
• An edge version of the matrix-tree theorem and the wiener index
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Algebraic connectivity of weighted trees under perturbation
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Coalescence, majorization, edge valuations and the laplacian spectra of graphs
• Ordering trees by algebraic connectivity

This page was built for publication: A minimax-condition for the characteristic center of a tree