AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if diam(G − x) ⩾ d + 1 for any x ∈ V(G). We prove that the number of edges in a vertex diameter-2-critical graph on n vertices with n ⩾ 23 is greater than or equal to (5n − 17)/2
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increases the ...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
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 k-critical if the graph has diameter k and the deletion of any edge in...
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 increas...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
AbstractA graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increases the ...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
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 k-critical if the graph has diameter k and the deletion of any edge in...
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 increas...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
AbstractA graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increases the ...
DOI
Add to ORKG