Bounds on the fault-diameter of graphs
From MaRDI portal
Publication:6496348
Recommendations
Cites work
- scientific article; zbMATH DE number 3510348 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 853694 (Why is no real title available?)
- A Lower Bound for the Number of Vertices of a Graph
- Diameter and inverse degree
- Diameter and maximum degree in Eulerian digraphs
- Diameter bounds for altered graphs
- Diameter increase caused by edge deletion
- Diameter of 4-colourable graphs
- Diameter vulnerability of graphs
- Disjoint paths of bounded length in large generalized cycles
- Distance and size in digraphs
- Edge, vertex and mixed fault diameters
- Fault diameter of interconnection networks
- Fault diameter of product graphs
- Fault tolerance properties of pyramid networks
- Generalized diameters of the mesh of trees
- Graphs of maximum diameter
- On Graphs that do not Contain a Thomsen Graph
- On diameter and inverse degree of a graph
- On the fault-diameter of the star graph
- On the sum of all distances in a graph or digraph
- Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
- Radius, diameter, and minimum degree
- Randić index and the diameter of a graph
- Some topological properties of folded Petersen graph
- The degree-diameter problem for claw-free graphs and hypergraphs
- The diameter of almost Eulerian digraphs
- The diameter of directed graphs
- The edge fault-diameter of Cartesian graph bundles
This page was built for publication: Bounds on the fault-diameter of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496348)
