A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs

DOI10.1016/j.ipl.2011.01.007zbMath1259.05109OpenAlexW2005436772MaRDI QIDQ1944903

Ping-Ying Tsai

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.01.007

zbMATH Keywords

networksHamiltonicityfault-tolerancepancyclicityalternating group graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Two disjoint cycles of various lengths in alternating group graph ⋮ Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model

Cites Work

• An optimal result on fault-tolerant cycle-embedding in alternating group graphs
• Fault-tolerant cycle-embedding in alternating group graphs
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Edge‐fault‐tolerant pancyclicity of alternating group graphs

This page was built for publication: A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs