Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
From MaRDI portal
Publication:6038696
DOI10.1016/j.tcs.2023.113860OpenAlexW4362604538MaRDI QIDQ6038696
Publication date: 2 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113860
Cites Work
- Unnamed Item
- Unnamed Item
- Conditional edge-fault pancyclicity of augmented cubes
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Optimal fault-tolerant embedding of paths in twisted cubes
- The super connectivity of augmented cubes
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
- Conditional edge-fault Hamiltonicity of augmented cubes
- Cycle embedding of augmented cubes
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
- Survey on path and cycle embedding in some networks
- Vertex pancyclic graphs
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- Pancyclic graphs. I
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- The spanning cyclability of Cayley graphs generated by transposition trees
- Automorphisms of augmented cubes
- A group-theoretic model for symmetric interconnection networks
- Augmented cubes
- Algorithms and Computation
This page was built for publication: Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes