Implicit degree condition restricted to essential independent sets for Hamiltonian cycles

Xing Huang ()
Additional contact information
Xing Huang: Huaerzhi Education and Technology Company Limited

Indian Journal of Pure and Applied Mathematics, 2024, vol. 55, issue 4, 1173-1179

Abstract: Abstract A cycle of a graph G is Hamiltonian if it visits every vertex of G exactly once. A graph is Hamiltonian if it has a Hamiltonian cycle. The problem of determining whether a graph is Hamiltonian is known to be NP-complete. A subset S of V(G) is called an essential independent set of G if S is an independent set and contains two distinct vertices u and v with a common neighbor. In 1989, Zhu, Li and Deng introduced the definitions of the first implicit degree and the second implicit degree of a vertex v in a graph G, denoted by $$id_1(v)$$ i d 1 ( v ) and $$id_2(v)$$ i d 2 ( v ) , respectively. In this paper, we show that a k-connected ( $$k\ge 2$$ k ≥ 2 ) graph G of order $$n\ge 3$$ n ≥ 3 is Hamiltonian if $$\max \{id_1(v): v\in S\}\ge n/2$$ max { i d 1 ( v ) : v ∈ S } ≥ n / 2 for every essential independent set S of order k and the bound “n/2” is tight, which generalizes the result due to Chen et al. [Essential Independent Sets and Hamiltonian Cycles, J. Graph Theory, 21 (1996) 243–250.].

Keywords: Implicit degree; Essential independent set; Hamiltonian cycle (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-023-00418-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00418-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-023-00418-x

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().