Two disjoint cycles of various lengths in alternating group graph
From MaRDI portal
Publication:2161900
Recommendations
- One-to-one disjoint path covers on alternating group graphs
- An optimal result on fault-tolerant cycle-embedding in alternating group graphs
- Fault-tolerant edge and vertex pancyclicity in alternating group graphs
- Edge‐fault‐tolerant pancyclicity of alternating group graphs
- Fault-tolerant cycle-embedding in alternating group graphs
Cites work
- A kind of conditional fault tolerance of alternating group graphs
- A new class of interconnection networks based on the alternating group
- A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
- A well-equalized 3-CIST partition of alternating group graphs
- Conditional Diagnosability of Alternating Group Graphs
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model
- Fault tolerance of edge pancyclicity in alternating group graphs
- Fault-tolerant cycle-embedding in alternating group graphs
- Fault-tolerant edge and vertex pancyclicity in alternating group graphs
- One-to-one disjoint path covers on alternating group graphs
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Structure and substructure connectivity of alternating group graphs
- The automorphism group of the alternating group graph
- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
- The pessimistic diagnosability of alternating group graphs under the PMC model
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
Cited in
(7)- Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
- Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
- Two-disjoint-cycle-cover pancyclicity of data center networks
- An algorithm for finding disjoint paths in the alternating group graph
- Two disjoint cycles in digraphs
- A disjoint path problem in the alternating group graph
- One-to-one disjoint path covers on alternating group graphs
This page was built for publication: Two disjoint cycles of various lengths in alternating group graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2161900)