Some sufficient conditions on hamilton graphs with toughness

Published on October 14, 2022

Imagine you have a web of interconnected cities, and you want to find the best route that visits every city exactly once. Well, mathematicians have been interested in a similar problem for graphs, called Hamiltonian cycles. In this article, researchers delve into the connection between the toughness of a graph and its ability to have a special cycle that passes through all its vertices. By investigating properties such as the number of edges, spectral radius, and signless Laplacian spectral radius of the graph, they establish conditions that ensure a graph with toughness is Hamiltonian. This research sheds light on the intricate interplay between these two concepts in the world of graphs.

Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is t-tough, denoted by τ(G). We call a graph G Hamiltonian if it has a cycle that contains all vertices of G. Chvátal and other scholars investigate the relationship between toughness conditions and the existence of cyclic structures. In this paper, we establish some sufficient conditions that a graph with toughness is Hamiltonian based on the number of edges, spectral radius, and signless Laplacian spectral radius of the graph.MR subject classifications: 05C50, 15A18.

Read Full Article (External Site)

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes:

<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>