Lower bounds for the algebraic connectivity of graphs with specified subgraphs

DOI10.5614/ejgta.2021.9.2.2zbMath1482.05213OpenAlexW3205418484MaRDI QIDQ5061677

Zoran Stanić

Publication date: 14 March 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.2

zbMATH Keywords

geometric meanHamiltonian cycleLaplacian matrixalgebraic connectivityedge-disjoint subgraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-disjoint Hamilton cycles in graphs
• Old and new results on algebraic connectivity of graphs
• Eigenvalues, diameter, and mean distance in graphs
• Graphs and Hermitian matrices: eigenvalue interlacing
• Proof of conjectures involving algebraic connectivity of graphs
• A lower bound for algebraic connectivity based on the connection-graph-stability method
• Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles

This page was built for publication: Lower bounds for the algebraic connectivity of graphs with specified subgraphs