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

Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube

Author

Listed:
  • Niu, Ruichao
  • Xu, Min
  • Lai, Hong-Jian

Abstract

Let r2≥r1≥0 be two integers. A bipartite graph G is two-disjoint-cycle-cover vertex [r1,r2]-bipancyclic (2-DCC vertex [r1,r2]-bipancyclic in short) if for any two vertices u,v∈V(G) and any even integer ℓ satisfying r1≤ℓ≤r2, there exist two vertex-disjoint cycles J1 and J2 in G with |V(J1)|=ℓ and |V(J2)|=|V(G)|−ℓ such that u∈V(J1) and v∈V(J2); and there also exist two vertex-disjoint cycles J1′ and J2′ in G with |V(J1′)|=ℓ and |V(J2′)|=|V(G)|−ℓ such that v∈V(J1′) and u∈V(J2′). We study the 2-DCC vertex bipancyclicity of the n-dimensional bipartite generalized hypercube C(d1,d2,…,dn). As a result, we determine a family of exceptional graphs and show that for all integers n≥2, an n-dimensional bipartite generalized hypercube G is 2-DCC vertex [4,|V(G)|/2]-bipancyclic if and only if G is not a member in this family. Furthermore, as applications, we prove the vertex-bipancyclicity and 2-DCC bipancyclicity on n-dimensional bipartite generalized hypercube and show that the similar properties also hold for all n-dimensional bipartite k-ary n-cubes, for n≥2.

Suggested Citation

  • Niu, Ruichao & Xu, Min & Lai, Hong-Jian, 2021. "Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube," Applied Mathematics and Computation, Elsevier, vol. 400(C).
    • Handle: RePEc:eee:apmaco:v:400:y:2021:i:c:s0096300321001387
    DOI: 10.1016/j.amc.2021.126090
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321001387
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126090?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cheng, Dongqin, 2022. "Two disjoint cycles of various lengths in alternating group graph," Applied Mathematics and Computation, Elsevier, vol. 433(C).

    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:400:y:2021:i:c:s0096300321001387. 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.