On trees with maximum algebraic connectivity

DOI10.2298/AADM160207002AzbMath1461.05029OpenAlexW2346911794MaRDI QIDQ5279872

Oscar Rojo, Luciana Lee, Lilian Markenzon, Nair Maria Maia De Abreu

Publication date: 19 July 2017

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm160207002a

zbMATH Keywords

algebraic connectivityLaplacian matricescharacteristic vertexbottleneck matricesdiameter-path tree

Mathematics Subject Classification ID

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

Related Items

Relationships between algebraic connectivity and vertex connectivity, Trees with matrix weights: Laplacian matrix and characteristic-like vertices, Schur reduction of trees and extremal entries of the Fiedler vector, Combinatorial Perron values of trees and bottleneck matrices, Perron value and moment of rooted trees, Perron values and classes of trees