A minimax-condition for the characteristic center of a tree
From MaRDI portal
Publication:4942584
Recommendations
- Maximizing the distance between center, centroid and characteristic set of a tree
- On the characteristic set, centroid, and centre for a tree
- A computational study of minimax flow centers in trees
- scientific article; zbMATH DE number 1744100
- scientific article; zbMATH DE number 3952788
- scientific article; zbMATH DE number 1186097
- The center function on trees
- A note on the minmax regret centdian location on trees
- Maximin Center of Pendant Vertices in a Tree Network
- On the centroid of increasing trees
Cites work
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A generalization of the matrix-tree theorem
- Algebraic connectivity of weighted trees under perturbation
- An edge version of the matrix-tree theorem and the wiener index
- Characteristic vertices of weighted trees via perron values
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Eigenvalues of the Laplacian of a graph∗
- Large eigenvalues of the laplacian
- Ordering trees by algebraic connectivity
- Permanental roots and the star degree of a graph
- The Laplacian Spectrum of a Graph
Cited in
(2)
This page was built for publication: A minimax-condition for the characteristic center of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942584)
