DOIAbstract
AbstractA diameter critical graph has the property that the addition of any edge decreases the diameter. All such graphs are determined for a given vertex connectivity and the edge number is given
AbstractA diameter critical graph has the property that the addition of any edge decreases the diameter. All such graphs are determined for a given vertex connectivity and the edge number is given
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
In graph theory, the term critical is usually used with respect to specified graph parameter P and ...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
<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 simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
Abstract In this paper, we consider various types of domination vertex critical graphs, including to...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
In graph theory, the term critical is usually used with respect to specified graph parameter P and ...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
<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 simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
Abstract In this paper, we consider various types of domination vertex critical graphs, including to...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
Add to ORKG