Maximizing the distance between center, centroid and characteristic set of a tree

DOI10.1080/03081080701208512zbMath1120.05021OpenAlexW2046832163MaRDI QIDQ3439834

Kamal Lochan Patra

Publication date: 18 May 2007

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

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

zbMATH Keywords

treecentercentroidcharacteristic set

Mathematics Subject Classification ID

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

Related Items (7)

Different central parts of trees and their pairwise distances ⋮ Trees with matrix weights: Laplacian matrix and characteristic-like vertices ⋮ About the type of broom trees ⋮ Maximizing distance between center, centroid and subtree core of trees ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Fiedler vector analysis for particular cases of connected graphs ⋮ A conjecture on different central parts of binary trees

Cites Work

• Laplacian matrices of graphs: A survey
• The perturbed laplacian matrix of a graph
• Characteristic vertices of weighted trees via perron values
• The Laplacian Spectrum of a Graph
• Perron components and algebraic connectivity for weighted graphs
• Algebraic connectivity of weighted trees under perturbation
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Algebraic connectivity and the characteristic set of a graph

This page was built for publication: Maximizing the distance between center, centroid and characteristic set of a tree