IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v494y2025ics009630032500027x.html
   My bibliography  Save this article

A Fan-type condition for cycles in 1-tough and k-connected (P2 ∪ kP1)-free graphs

Author

Listed:
  • Hu, Zhiquan
  • Wang, Jie
  • Shen, Changlong

Abstract

For a graph G, define μk(G):=min⁡{maxx∈S⁡dG(x):S∈Sk}, where Sk is the set consisting of all independent sets {u1,…,uk} of G such that some vertex, say ui (1≤i≤k), is at distance two from every other vertex in it. A graph G is called 1-tough if for each cut set S⊆V(G), G−S has no more than |S| components. Recently, Shi and Shan [19] conjectured that for each integer k≥4, being 2k-connected is sufficient for 1-tough (P2∪kP1)-free graphs to be hamiltonian, which was confirmed by Xu et al. [20] and Ota and Sanka [16], respectively. In this article, we generalize the above results through the following Fan-type theorem: If G is a 1-tough and k-connected (P2∪kP1)-free graph and satisfies μk+1(G)≥7k−65, where k≥2 is an integer, then G is hamiltonian or the Petersen graph.

Suggested Citation

  • Hu, Zhiquan & Wang, Jie & Shen, Changlong, 2025. "A Fan-type condition for cycles in 1-tough and k-connected (P2 ∪ kP1)-free graphs," Applied Mathematics and Computation, Elsevier, vol. 494(C).
    • Handle: RePEc:eee:apmaco:v:494:y:2025:i:c:s009630032500027x
    DOI: 10.1016/j.amc.2025.129300
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032500027X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129300?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:eee:apmaco:v:494:y:2025:i:c:s009630032500027x. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.