AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge increased its diameter. We prove that if G is diameter 2-critical graph on n vertices and e edges, then (i) e⩽[14n2] for n⩽24, and (ii) e<14n2 + (n2 - 16.2n + 56)/320 (<0.2532 n2), for n ⩾25
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractA graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
A graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increases the ...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
We define a graph G=(V, E) with m=\E\ edges, n=\V\ vertices, maximum degree D, and diameter d, to b...
AbstractA graph G is diameter 2-critical if its diameter is two and the deletion of any edge increas...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the di...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph $$G$$G is diameter 2-critical if its diameter is two and the deletion of any edge increases ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractA graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
A graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increases the ...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
We define a graph G=(V, E) with m=\E\ edges, n=\V\ vertices, maximum degree D, and diameter d, to b...
AbstractA graph G is diameter 2-critical if its diameter is two and the deletion of any edge increas...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the di...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph $$G$$G is diameter 2-critical if its diameter is two and the deletion of any edge increases ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
DOI
Add to ORKG