AbstractA graph G is domination dot-critical, or just dot-critical, if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. In this paper, we study an open question concerning of the diameter of a domination dot-critical graph G
AbstractA set D of vertices in a connected graph G is called a k-dominating set if every vertex in G...
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...
Abstract. A graph G is k-dot-critical (totaly k-dot-critical) if G is dot-critical (totaly dot-criti...
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 graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
AbstractA graph G is dot-critical if contracting any edge decreases the domination number. It is tot...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
AbstractA graph G is dot-critical if contracting any edge decreases the domination number. It is tot...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
AbstractA set D of vertices in a connected graph G is called a k-dominating set if every vertex in G...
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...
Abstract. A graph G is k-dot-critical (totaly k-dot-critical) if G is dot-critical (totaly dot-criti...
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 graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
AbstractA graph G is dot-critical if contracting any edge decreases the domination number. It is tot...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that ...
AbstractA graph G is dot-critical if contracting any edge decreases the domination number. It is tot...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
AbstractA set D of vertices in a connected graph G is called a k-dominating set if every vertex in G...
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...
DOI
Add to ORKG