Edge-fault-tolerant pancyclicity of arrangement graphs

DOI10.1016/j.ins.2014.06.046zbMath1355.68026OpenAlexW1998914391MaRDI QIDQ508679

Kaishun Wang, Sainan Sun, Min Xu

Publication date: 7 February 2017

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

Full work available at URL: https://doi.org/10.1016/j.ins.2014.06.046

zbMATH Keywords

pancyclicityarrangement graphedge-fault-toleranceHamiltonian connected

Mathematics Subject Classification ID

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

Related Items

The bipanconnectivity of bipartite hypercube-like networks ⋮ Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes ⋮ The symmetry property of (n,k)‐arrangement graph ⋮ Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults

Cites Work

• Unnamed Item
• Unnamed Item
• Hyper Hamiltonian laceability on edge fault star graph
• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Fault-free longest paths in star networks with conditional link faults
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Survey on path and cycle embedding in some networks
• Edge-pancyclic block-intersection graphs
• Arrangement graphs: A class of generalized star graphs
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Pancyclic graphs. I
• Cycle embedding in star graphs with edge faults
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Embedding of cycles in arrangement graphs
• Longest fault-free paths in star graphs with vertex faults