Characteristic vertices of weighted trees via perron values
From MaRDI portal
Publication:3124877
DOI10.1080/03081089608818448zbMath0866.05041MaRDI 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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Algebraic connectivity of weighted trees under perturbation, On operations in which graphs are appended to trees, On the least eigenvalue of a unicyclic mixed graph, On a bound on algebraic connectivity: the case of equality, Constructions for type I trees with nonisomorphic Perron branches, A minimax-condition for the characteristic center of a tree, Algebraic connectivity and the characteristic set of a graph, The algebraic connectivity of lollipop graphs, On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian, Ordering trees with nearly perfect matchings by algebraic connectivity, Algebraic connectivity and degree sequences of trees, The algebraic connectivity of graphs under perturbation, A conjecture on the algebraic connectivity of connected graphs with fixed girth, First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph, The ordering of unicyclic graphs with the smallest algebraic connectivity, Some characterizations of symmetric inverse \(M\)-matrices, A note on limit points for algebraic connectivity, The limit points of Laplacian spectra of graphs, The effect on the algebraic connectivity of a tree by grafting or collapsing of edges, The six classes of trees with the largest algebraic connectivity, The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices, The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector, The perturbed laplacian matrix of a graph, ALGEBRAIC CONNECTIVITY OF WEIGHED GRAPHS UNDER SHIFTING COMPONENTS, Maximizing the distance between center, centroid and characteristic set of a tree, On eigenvectors of mixed graphs with exactly one nonsingular cycle, The Laplacian spectra of graphs with a tree structure, Hereditary properties of matrices with cut-points, Perron components and algebraic connectivity for weighted graphs
Cites Work
