Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
From MaRDI portal
Publication:6038696
Recommendations
Cites work
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Algorithms and Computation
- Augmented cubes
- Automorphisms of augmented cubes
- Conditional edge-fault Hamiltonicity of augmented cubes
- Conditional edge-fault pancyclicity of augmented cubes
- Cycle embedding of augmented cubes
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
- Graph theory
- Optimal fault-tolerant embedding of paths in twisted cubes
- Pancyclic graphs. I
- Survey on path and cycle embedding in some networks
- The spanning cyclability of Cayley graphs generated by transposition trees
- The super connectivity of augmented cubes
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- Vertex pancyclic graphs
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
Cited in
(3)
This page was built for publication: Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038696)