Edge-fault-tolerant pancyclicity of arrangement graphs

DOI10.1016/J.INS.2014.06.046MaRDI QIDQ508679zbMATH OpenOpenAlexFDO

Authors Sainan Sun, Kaishun Wang, 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

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)

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

Cites work

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

Cited in

(11)

• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• The super spanning connectivity of arrangement graphs
• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• The symmetry property of (n,k)‐arrangement graph
• The bipanconnectivity of bipartite hypercube-like networks
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Fault-free Hamiltonian cycles in balanced hypercubes with conditional edge faults
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
• Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle

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)