Hamiltonian graphs of given order and minimum algebraic connectivity

2017/03/13 by Shu-Guang Guo, Rong Zhang, Guanglong Yu · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Interconnection Networks and Systems #Advanced Graph Theory Research

paper · doi:10.1080/03081087.2017.1301363

Abstract

In this paper, we study the algebraic connectivity of a Hamiltonian graph, and determine all Hamiltonian graphs whose algebraic connectivity attain the minimum among all Hamiltonian graphs on n vertices.

Cited by

• Cubic bipartite graphs with minimum spectral gap

Related

• Graphs with Many Hamiltonian Paths
• The maximum degree of a minimally hamiltonian-connected graph
• A New Property of Hamilton Graphs
• Minimum degree ensuring that a hypergraph is hamiltonian-connected
• Algebraic connectivity of connected graphs with fixed number of pendant vertices