Embedding longest fault-free paths in arrangement graphs with faulty vertices

DOI<84::AID-NET3>3.0.CO;2-A 10.1002/1097-0037(200103)37:2<84::AID-NET3>3.0.CO;2-AzbMath0977.68068OpenAlexW1994922227MaRDI QIDQ2714908

Gen-Huey Chen, Ray-Shang Lo

Publication date: 20 June 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200103)37:2<84::aid-net3>3.0.co;2-a

zbMATH Keywords

star grapharrangement graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ Linearly many faults in arrangement graphs ⋮ Conditional matching preclusion for the arrangement graphs

Cites Work

• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Arrangement graphs: A class of generalized star graphs
• A group-theoretic model for symmetric interconnection networks
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Unnamed Item

This page was built for publication: Embedding longest fault-free paths in arrangement graphs with faulty vertices