Fault-tolerant edge and vertex pancyclicity in alternating group graphs

DOI10.1016/j.amc.2010.08.018zbMath1215.05141OpenAlexW2065061560MaRDI QIDQ606860

Andrzej Szepietowski

Publication date: 18 November 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.08.018

zbMATH Keywords

fault toleranceHamiltonian cyclepancyclicityalternating group graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Two disjoint cycles of various lengths in alternating group graph ⋮ Fault tolerance of edge pancyclicity in alternating group graphs ⋮ Fault tolerance of vertex pancyclicity in alternating group graphs

Cites Work

• An optimal result on fault-tolerant cycle-embedding in alternating group graphs
• Fault-tolerant cycle-embedding in alternating group graphs
• A new class of interconnection networks based on the alternating group

This page was built for publication: Fault-tolerant edge and vertex pancyclicity in alternating group graphs