Bounds on the subdominant eigenvalue involving group inverse with applications to graphs

DOI10.1023/A:1022455208972zbMath0931.15012MaRDI QIDQ4700041

Michael Neumann, Stephen J. Kirkland, Bryan L. Shader

Publication date: 18 November 1999

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30397

zbMATH Keywords

treeeigenvaluenonnegative matrixlower and upper boundsundirected graphalgebraic connectivityirreducible \(M\)-matrixgroup generalized inverse

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48) Connectivity (05C40)

Related Items

The sharpness of a lower bound on the algebraic connectivity for maximal graphs ⋮ On graphs with equal algebraic and vertex connectivity ⋮ On a bound on algebraic connectivity: the case of equality ⋮ Random walk centrality and a partition of Kemeny’s constant ⋮ On operations in which graphs are appended to trees ⋮ On trees with perfect matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph partitioning by eigenvectors
• Non-negative matrices and Markov chains. 2nd ed
• Eigenvalues, diameter, and mean distance in graphs
• Convergent nonnegative matrices and iterative methods for consistent linear systems
• Laplacian matrices of graphs: A survey
• Derivatives and Perturbations of Eigenvectors
• The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Sensitivity of the Stationary Distribution of a Markov Chain