Add to ORKGAbstract In this paper, we consider various types of domination vertex critical graphs, including total domination vertex critical graphs and independent domination vertex critical graphs and connected domination vertex critical graphs. We provide upper bounds on the diameter of them, two of which are sharp. MS
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
AbstractA set of vertices S is said to dominate the graph G if for each v ∉ S, there is a vertex u ∈...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
Abstract. A graph G is k-dot-critical (totaly k-dot-critical) if G is dot-critical (totaly dot-criti...
A graph G is k-dot-critical (totally k-dot-critical) if G is dot-critical (totally dot-critical) and...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
Denote the total domination number of a graph G by γₜ(G). A graph G is said to be total domination e...
AbstractSumner and Blitch defined a graph G to be k-y-critical if y(G) = k and y(G + uv) = k - 1 for...
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domin...
summary:In this paper we continue the study of paired-domination in graphs introduced by Haynes and ...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
AbstractA set of vertices S is said to dominate the graph G if for each v ∉ S, there is a vertex u ∈...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
Abstract. A graph G is k-dot-critical (totaly k-dot-critical) if G is dot-critical (totaly dot-criti...
A graph G is k-dot-critical (totally k-dot-critical) if G is dot-critical (totally dot-critical) and...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination e...
Denote the total domination number of a graph G by γₜ(G). A graph G is said to be total domination e...
AbstractSumner and Blitch defined a graph G to be k-y-critical if y(G) = k and y(G + uv) = k - 1 for...
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domin...
summary:In this paper we continue the study of paired-domination in graphs introduced by Haynes and ...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
AbstractA set of vertices S is said to dominate the graph G if for each v ∉ S, there is a vertex u ∈...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...