Hamiltonian graphs of given order and minimum algebraic connectivity
From MaRDI portal
Publication:5206285
DOI10.1080/03081087.2017.1301363zbMath1429.05115OpenAlexW2737184446MaRDI QIDQ5206285
Rong Zhang, Shu-Guang Guo, Guanglong Yu
Publication date: 18 December 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2017.1301363
Extremal problems in graph theory (05C35) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
2-connected graphs with the minimum algebraic connectivity ⋮ The algebraic connectivity of graphs with given circumference
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds of Laplacian spectrum of graphs based on the domination number
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Old and new results on algebraic connectivity of graphs
- Algebraic connectivity and degree sequences of trees
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Graphs of given order and size and minimum algebraic connectivity
- The algebraic connectivity of graphs with given matching number
- Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Algebraic connectivity and the characteristic set of a graph
- Algebraic connectivity of k-connected graphs
This page was built for publication: Hamiltonian graphs of given order and minimum algebraic connectivity
