The maximum degree of a minimally hamiltonian-connected graph

2022/01/14 by Zhan, Xingzhi
#05C07 #05C45 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2201.05292

Abstract

We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

Related

• Hamiltonian graphs of given order and minimum algebraic connectivity
• Graphs with Many Hamiltonian Paths
• The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
• Minimum degree ensuring that a hypergraph is hamiltonian-connected
• On k-ordered Hamiltonian Graphs