Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
From MaRDI portal
Publication:2185407
DOI10.1016/J.AMC.2020.125305OpenAlexW3018689757MaRDI QIDQ2185407FDOQ2185407
Authors: Chao Wei, Jou-Ming Chang, Rong-Xia Hao 
Publication date: 4 June 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125305
Recommendations
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
- Bipanconnectivity of balanced hypercubes
- Edge-disjoint Hamiltonian cycles of balanced hypercubes
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Survey on path and cycle embedding in some networks
- Pancyclic graphs. I
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- Title not available (Why is that?)
- Conditional diagnosability of balanced hypercubes under the PMC model
- Matching preclusion for balanced hypercubes
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Super connectivity of balanced hypercubes
- Two node-disjoint paths in balanced hypercubes
- Symmetric Property and Reliability of Balanced Hypercube
- Vertex pancyclic graphs
- Cycles embedding in balanced hypercubes with faulty edges and vertices
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Various cycles embedding in faulty balanced hypercubes
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Hamiltonian paths passing through prescribed edges in balanced hypercubes
- Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- Edge-disjoint Hamiltonian cycles of balanced hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- The \(h\)-edge tolerable diagnosability of balanced hypercubes
Cited In (13)
- Edge-disjoint Hamiltonian cycles of balanced hypercubes
- An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes
- Two-disjoint-cycle-cover pancyclicity of data center networks
- Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
- Two node-disjoint paths in balanced hypercubes
- Bipanconnectivity of balanced hypercubes
- The \(h\)-restricted connectivity of balanced hypercubes
- Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
- Two disjoint cycles of various lengths in alternating group graph
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- Vertex-bipancyclicity of the generalized honeycomb tori
- Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
This page was built for publication: Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185407)
