Add to ORKGDenote the total domination number of a graph G by γt(G). A graph G is said to be total domination edge critical, or simply γt-critical, if γt(G + e) < γt(G) for each edge e ∈ E(G). For 3t-critical graphs G, that is, γt-critical graphs with γt(G) = 3, the diameter of G is either 2 or 3. We characterise the 3t-critical graphs G with diam G = 3. 1
AbstractA total dominating set of a graph G=(V,E) with no isolated vertex is a set S⊆V such that eve...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
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 γₜ(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...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
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 with no isolated vertex is total domination vertex critical if for any vertex v of...
AbstractLet γt(G) denote the total domination number of the graph G. The graph G is said to be total...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
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 is called γ-critical if the removal of any vertex from the graph decreases the domin...
AbstractA total dominating set of a graph G=(V,E) with no isolated vertex is a set S⊆V such that eve...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
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 γₜ(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...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
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 with no isolated vertex is total domination vertex critical if for any vertex v of...
AbstractLet γt(G) denote the total domination number of the graph G. The graph G is said to be total...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the d...
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 is called γ-critical if the removal of any vertex from the graph decreases the domin...
AbstractA total dominating set of a graph G=(V,E) with no isolated vertex is a set S⊆V such that eve...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...