Characteristic vertices of weighted trees via perron values
From MaRDI portal
Publication:3124877
DOI10.1080/03081089608818448zbMath0866.05041OpenAlexW2028025438MaRDI QIDQ3124877
Michael Neumann, Stephen J. Kirkland, Bryan L. Shader
Publication date: 13 March 1997
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081089608818448
Related Items (53)
Constructions for type I trees with nonisomorphic Perron branches ⋮ Perron components and algebraic connectivity for weighted graphs ⋮ Different central parts of trees and their pairwise distances ⋮ Inverse Perron values and connectivity of a uniform hypergraph ⋮ On algebraic connectivity of graphs with at most two points of articulation in each block ⋮ A Calderón type inverse problem for tree graphs ⋮ Trees with matrix weights: Laplacian matrix and characteristic-like vertices ⋮ Schur reduction of trees and extremal entries of the Fiedler vector ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ About the type of broom trees ⋮ The algebraic connectivity of lollipop graphs ⋮ On the characteristic set, centroid, and centre for a tree ⋮ Combinatorial Perron values of trees and bottleneck matrices ⋮ A note on limit points for algebraic connectivity ⋮ Ordering trees with nearly perfect matchings by algebraic connectivity ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Algebraic connectivity of weighted trees under perturbation ⋮ Combinatorial Perron parameters for trees ⋮ Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs ⋮ The effect on the algebraic connectivity of a tree by grafting or collapsing of edges ⋮ On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) ⋮ The six classes of trees with the largest algebraic connectivity ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Algebraic connectivity and degree sequences of trees ⋮ The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices ⋮ A tight upper bound on the spectral radius of bottleneck matrices for graphs ⋮ The perturbed laplacian matrix of a graph ⋮ A minimax-condition for the characteristic center of a tree ⋮ Algebraic connectivity and the characteristic set of a graph ⋮ On the least eigenvalue of a unicyclic mixed graph ⋮ The algebraic connectivity of graphs under perturbation ⋮ ALGEBRAIC CONNECTIVITY OF WEIGHED GRAPHS UNDER SHIFTING COMPONENTS ⋮ A conjecture on the algebraic connectivity of connected graphs with fixed girth ⋮ On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian ⋮ On eigenvectors of mixed graphs with exactly one nonsingular cycle ⋮ On a bound on algebraic connectivity: the case of equality ⋮ The Laplacian spectra of graphs with a tree structure ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ Perron value and moment of rooted trees ⋮ A Fiedler-like theory for the perturbed Laplacian ⋮ On operations in which graphs are appended to trees ⋮ Perron values and classes of trees ⋮ Maximizing the algebraic connectivity for a subclass of caterpillars ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ The ordering of unicyclic graphs with the smallest algebraic connectivity ⋮ The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector ⋮ A Fiedler center for graphs generalizing the characteristic set ⋮ Algebraic connectivity of k-connected graphs ⋮ Some characterizations of symmetric inverse \(M\)-matrices ⋮ Hereditary properties of matrices with cut-points ⋮ Fiedler vector analysis for particular cases of connected graphs ⋮ Maximizing the distance between center, centroid and characteristic set of a tree ⋮ The limit points of Laplacian spectra of graphs
Cites Work
This page was built for publication: Characteristic vertices of weighted trees via perron values
