Bounds on the fault-diameter of graphs

DOI10.1002/NET.21758MaRDI QIDQ6496348

Peter Dankelmann

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

diameteredge-fault-tolerant diameterfault-tolerant diameterfault-diameterdiameter-vulnerabilityedge-fault-diameter

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance and size in digraphs
• The diameter of almost Eulerian digraphs
• Randić index and the diameter of a graph
• Diameter vulnerability of graphs
• Edge, vertex and mixed fault diameters
• Fault diameter of product graphs
• Diameter and maximum degree in Eulerian digraphs
• Some topological properties of folded Petersen graph
• On diameter and inverse degree of a graph
• The edge fault-diameter of Cartesian graph bundles
• Diameter of 4-colourable graphs
• Fault diameter of interconnection networks
• Graphs of maximum diameter
• On the fault-diameter of the star graph
• Radius, diameter, and minimum degree
• Disjoint paths of bounded length in large generalized cycles
• The diameter of directed graphs
• Generalized diameters of the mesh of trees
• Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
• Diameter and inverse degree
• The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs
• On the sum of all distances in a graph or digraph
• Diameter increase caused by edge deletion
• Fault tolerance properties of pyramid networks
• Diameter bounds for altered graphs
• A Lower Bound for the Number of Vertices of a Graph
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Bounds on the fault-diameter of graphs