Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph

DOI10.1016/J.INS.2013.02.012zbMATH Open1284.05145OpenAlexW1992434676MaRDI QIDQ2446463FDOQ2446463

Authors: Xiebin Chen 

Publication date: 16 April 2014

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

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

Recommendations

• Conditional fault Hamiltonicity of the complete graph
• Conditional fault hamiltonian connectivity of the complete graph
• Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
• Edge-fault-tolerant pancyclicity of arrangement graphs
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges

zbMATH Keywords

fault-toleranceedge-pancyclicityinterconnection networkcomplete graphpanconnectivityHamiltonicity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Edge-fault-tolerant bipanconnectivity of hypercubes
• Long paths in hypercubes with conditional node-faults
• Survey on path and cycle embedding in some networks
• Edge-bipancyclicity of conditional faulty hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Graph theory with applications
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many disjoint paths in faulty hypercubes
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Path partitions of hypercubes
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Cycles passing through a prescribed path in a hypercube with faulty edges
• Path embeddings in faulty 3-ary \(n\)-cubes
• The bipancycle-connectivity of the hypercube
• Conditional fault hamiltonian connectivity of the complete graph
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Edge-fault-tolerant node-pancyclicity of twisted cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Conditional fault Hamiltonicity of the complete graph
• The spanning connectivity of folded hypercubes
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
• Some results on topological properties of folded hypercubes

Cited In (11)

• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Panconnectivity for interconnection networks with faulty elements
• Conditional fault Hamiltonicity of the complete graph
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Odd cycles embedding on folded hypercubes with conditional faulty edges
• Conditional fault hamiltonian connectivity of the complete graph
• Vertex-fault-tolerant cycles embedding in balanced hypercubes

This page was built for publication: Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph

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