Minimizing algebraic connectivity over connected graphs with fixed girth

DOI10.1016/S0012-365X(01)00355-7zbMath0995.05092OpenAlexW1996070164MaRDI QIDQ1613533

Sukanta Pati, Shaun M. Fallat, Stephen J. Kirkland

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00355-7

zbMATH Keywords

girthLaplacian matrixalgebraic connectivityunicyclic graphcharacteristic set

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (24)

Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles ⋮ Extremizing first eigenvalue of 3-colored digraphs made with given blocks ⋮ On algebraic connectivity of graphs with at most two points of articulation in each block ⋮ The algebraic connectivity of graphs with given circumference ⋮ The algebraic connectivity of graphs with given matching number ⋮ Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth ⋮ Old and new results on algebraic connectivity of graphs ⋮ The algebraic connectivity of lollipop graphs ⋮ Spectral characterizations of lollipop graphs ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ A survey of automated conjectures in spectral graph theory ⋮ The Laplacian spectral radius for unicyclic graphs with given independence number ⋮ The algebraic connectivity of graphs under perturbation ⋮ A conjecture on the algebraic connectivity of connected graphs with fixed girth ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ The lollipop graph is determined by its \(Q\)-spectrum ⋮ The ordering of unicyclic graphs with the smallest algebraic connectivity ⋮ Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue ⋮ First eigenvalue of nonsingular mixed graphs with given number of pendant vertices ⋮ On minimum algebraic connectivity of graphs whose complements are bicyclic

This page was built for publication: Minimizing algebraic connectivity over connected graphs with fixed girth