IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v55y2024i4d10.1007_s13226-023-00418-x.html
   My bibliography  Save this article

Implicit degree condition restricted to essential independent sets for Hamiltonian cycles

Author

Listed:
  • Xing Huang

    (Huaerzhi Education and Technology Company Limited)

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.].

Suggested Citation

  • Xing Huang, 2024. "Implicit degree condition restricted to essential independent sets for Hamiltonian cycles," Indian Journal of Pure and Applied Mathematics, Springer, vol. 55(4), pages 1173-1179, December.
  • Handle: RePEc:spr:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00418-x
    DOI: 10.1007/s13226-023-00418-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-023-00418-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13226-023-00418-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00418-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.