The sharpness of a lower bound on the algebraic connectivity for maximal graphs
From MaRDI portal
Publication:2720366
DOI10.1080/03081080108818670zbMath0987.05074OpenAlexW2005825858MaRDI QIDQ2720366
Jason J. Molitierno, Michael Neumann, Stephen J. Kirkland
Publication date: 9 April 2002
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080108818670
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Vertex degrees (05C07)
Related Items
Unoriented Laplacian maximizing graphs are degree maximal, On graphs with equal algebraic and vertex connectivity, Delta invariant for Eulerian digraphs, Maximal graphs and graphs with maximal spectral radius
Cites Work
- A characterization of Dobrushin's coefficient of ergodicity
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
- Non-negative matrices and Markov chains. 2nd ed
- Singular M-matrices and inverse positivity
- Degree maximal graphs are Laplacian integral
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- Inclusion domains for the eigenvalues of stochastic matrices
- Seven criteria for integer sequences being graphic
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- Computation of the stationary distribution of a markov chain
- A Representation of the Drazin Inverse and Characterizations of the Index
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
- On a bound on algebraic connectivity: the case of equality
