Edge-fault-tolerant pancyclicity of arrangement graphs

DOI10.1016/J.INS.2014.06.046zbMATH Open1355.68026OpenAlexW1998914391MaRDI QIDQ508679FDOQ508679

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

Recommendations

• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Fault tolerance of edge pancyclicity in alternating group graphs
• Fault-tolerant edge and vertex pancyclicity in alternating group graphs
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
• Linearly many faults in arrangement graphs

zbMATH Keywords

pancyclicityarrangement graphedge-fault-toleranceHamiltonian connected

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
• The bipanconnectivity of bipartite hypercube-like networks
• Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults
• The Super Spanning Connectivity of Arrangement Graphs
• Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle
• The symmetry property of (n,k)‐arrangement graph
• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes

This page was built for publication: Edge-fault-tolerant pancyclicity of arrangement graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508679)