An optimal result on fault-tolerant cycle-embedding in alternating group graphs
From MaRDI portal
Publication:990959
DOI10.1016/j.ipl.2009.08.006zbMath1197.05086OpenAlexW2038059953MaRDI QIDQ990959
Publication date: 1 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.006
networksfault-tolerancepancyclicityhamiltonicityalternating group graphcomputing systeminterconnection network topology
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Fault-tolerant edge and vertex pancyclicity in alternating group graphs ⋮ A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs ⋮ Fault tolerance of edge pancyclicity in alternating group graphs ⋮ Fault tolerance of vertex pancyclicity in alternating group graphs ⋮ The panpositionable panconnectedness of augmented cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Fault-tolerant cycle-embedding in alternating group graphs
- On embedding cycles into faulty twisted cubes
- Cycles in folded hypercubes
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Minimumk-hamiltonian graphs, II
- A new class of interconnection networks based on the alternating group
- Panpositionable hamiltonicity of the alternating group graphs
This page was built for publication: An optimal result on fault-tolerant cycle-embedding in alternating group graphs