Add to ORKGA graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on n vertices is at most n
AbstractA graph G is diameter-2-critical if its diameter is two and the deletion of any edge increas...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
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 graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
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 2-critical if its diameter is two and the deletion of any edge increas...
A graph $$G$$G is diameter 2-critical if its diameter is two and the deletion of any edge increases ...
International audienceA graph is diameter-2-critical if its diameter is 2 but the removal of any edg...
A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the di...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
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 G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
AbstractA graph G is diameter-2-critical if its diameter is two and the deletion of any edge increas...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
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 graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
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 2-critical if its diameter is two and the deletion of any edge increas...
A graph $$G$$G is diameter 2-critical if its diameter is two and the deletion of any edge increases ...
International audienceA graph is diameter-2-critical if its diameter is 2 but the removal of any edg...
A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the di...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
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 G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
AbstractA graph G is diameter-2-critical if its diameter is two and the deletion of any edge increas...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...