Edge fault tolerance in graphs

DOI10.1002/net.3230230207zbMath0796.05046OpenAlexW1988993295MaRDI QIDQ5287446

John P. Hayes, Frank Harary

Publication date: 5 September 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230207

zbMATH Keywords

pathscycleshypercubescomplete graphsfault-tolerancetolerance number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (36)

Faithful 1-edge fault tolerant graphs ⋮ Optimal 1-Hamiltonian graphs ⋮ Christmas tree: a versatile 1-fault-tolerant design for token rings ⋮ Vertex extensions of 4-layer graphs and hypercubes ⋮ THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS ⋮ Dynamic graph models ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection ⋮ One node fault tolerance for caterpillars and starlike trees ⋮ On the complexity of some problems related to graph extensions ⋮ On the construction of combinedk-fault-tolerant Hamiltonian graphs ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ Fault-tolerant maximal local-connectivity on bubble-sort star graphs ⋮ UPPER BOUND FOR THE NUMBER OF ADDITIONAL EDGES IN MINIMAL 1-EDGE EXTENSIONS OF STARLIKE TREES ⋮ ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION ⋮ Hamiltonian cycles in hypercubes with faulty edges ⋮ Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs ⋮ On cubic 2-independent Hamiltonian connected graphs ⋮ Construction schemes for fault-tolerant Hamiltonian graphs ⋮ Fault-free cycles in folded hypercubes with more faulty elements ⋮ Cubic planar Hamiltonian graphs of various types ⋮ The Generalized Connectivity of Bubble-Sort Star Graphs ⋮ Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions ⋮ Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs ⋮ Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives ⋮ Globally bi-3*-connected graphs ⋮ Linear array and ring embeddings in conditional faulty hypercubes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal 1-edge fault-tolerant designs for ladders. ⋮ About uniqueness of the minimal 1-edge extension of hypercube Q4 ⋮ A note on edge fault tolerance with respect to hypercubes ⋮ Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

Cites Work

• Unnamed Item

This page was built for publication: Edge fault tolerance in graphs