Paw-Type Characterization of Hourglass-Free Hamilton-Connected Graphs.

This paper introduces the forbidden subgraph conditions for Hamilton-connected graphs. If the degree sequence of the graph is (4 , 2 , 2 , 2 , 2) and it is connected, then it is called hourglass Γ 0 . For integers i ≥ 1 , the graph Z i is paw, which is obtained by attaching one of the vertices of the triangle to one of the end vertices of a path with a number of edges i. We show that every graph G is Hamilton-connected if G is a Γ 0 -free, K 1 , 3 -free, Z 14 -free, and a 3-connected graph. Moreover, we give an example to show the sharpness of a paw-type forbidden subgraph in a 3-connected, Hamilton-connected graph. Our focus on the Hamilton-connected problem can be applied to data center networks (DCNs). In the future, we will remove the forbidden subgraph families from our conclusions when building the network to obtain the optimal communication cost. Our result extends the result of Ryjáček and Vrána (Discrete Mathematics 344: 112350, 2021). [ABSTRACT FROM AUTHOR]