Pages that link to "Item:Q1011748"
From MaRDI portal
The following pages link to Diameter vulnerability of graphs by edge deletion (Q1011748):
Displaying 16 items.
- Diameter vulnerability of graphs (Q800372) (← links)
- Edge, vertex and mixed fault diameters (Q840704) (← links)
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs (Q967381) (← links)
- Graphs with small diameter after edge deletion (Q1199416) (← links)
- Vulnerability in graphs of diameter four (Q1310232) (← links)
- Diameter-vulnerability of large bipartite digraphs (Q1917252) (← links)
- Edge vulnerability parameters of split graphs (Q2371083) (← links)
- Changing and unchanging open packing: edge removal (Q2798334) (← links)
- Diameter vulnerability of directed cycles and directed tori (Q2905304) (← links)
- Diameter increase caused by edge deletion (Q3789599) (← links)
- Characterization of some extremal graphs with diameter no greater than three (Q4367629) (← links)
- The diameter vulnerability of the generalized Petersen graphGP[tk;k] (Q4633381) (← links)
- Some diameter notions in lexicographic product of graphs (Q5009987) (← links)
- Minimum diameter and <i>t<sub>F</sub></i>(<i>f, q</i>) (Q5035805) (← links)
- Diameter bounds for altered graphs (Q5187315) (← links)
- Perturbation results for distance-edge-monitoring numbers (Q6593703) (← links)