Embedding Hamiltonian cycles in alternating group graphs under conditional fault model

DOI10.1016/J.INS.2008.10.030zbMath1163.68330OpenAlexW2095695454MaRDI QIDQ1007887

Jung-Sheng Fu, Ping-Ying Tsai, Gen-Huey Chen

Publication date: 24 March 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154736/1/52.pdf

zbMATH Keywords

Cayley graphfault toleranceHamiltonian cyclealternating group graphconditional fault

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (14)

Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Two disjoint cycles of various lengths in alternating group graph ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Conditional matching preclusion for the alternating group graphs and split-stars ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ On the reliability of alternating group graph-based networks ⋮ Embedding meshes into twisted-cubes ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model

Cites Work

• Unnamed Item
• Hyper Hamiltonian laceability on edge fault star graph
• Fault-free longest paths in star networks with conditional link faults
• The shuffle-cubes and their generalization
• Linear array and ring embeddings in conditional faulty hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Robustness of star graph network under link failure
• Fault-tolerant cycle-embedding in alternating group graphs
• On the arrangement graph.
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Hamiltonian fault-tolerance of hypercubes
• A group-theoretic model for symmetric interconnection networks
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• Augmented cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Efficient Gossiping by Packets in Networks with Random Faults
• A new class of interconnection networks based on the alternating group
• Panpositionable hamiltonicity of the alternating group graphs
• Combinatorial analysis of the fault-diameter of the n-cube
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Embedding Hamiltonian cycles in alternating group graphs under conditional fault model