Some sufficient conditions on hamilton graphs with toughness

Cai, Gaixiang and Yu, Tao and Xu, Huan and Yu, Guidong (2022) Some sufficient conditions on hamilton graphs with toughness. Frontiers in Computational Neuroscience, 16. ISSN 1662-5188

[thumbnail of pubmed-zip/versions/1/package-entries/fncom-16-1019039/fncom-16-1019039.pdf] Text
pubmed-zip/versions/1/package-entries/fncom-16-1019039/fncom-16-1019039.pdf

Download (187kB)
[thumbnail of pubmed-zip/versions/1/package-entries/fncom-16-1019039/fncom-16-1019039.pdf] Text
pubmed-zip/versions/1/package-entries/fncom-16-1019039/fncom-16-1019039.pdf - Published Version

Download (187kB)

Abstract

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.

Item Type: Article
Subjects: Journal Eprints > Medical Science
Depositing User: Managing Editor
Date Deposited: 27 Mar 2023 09:17
Last Modified: 29 Feb 2024 04:16
URI: http://repository.journal4submission.com/id/eprint/1682

Actions (login required)

View Item
View Item