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) \u3c γt(G) for each edge e ∈ E(Ḡ). In this introductory paper we give some basic results on γt-critical graphs, discuss properties of 3t-critical graphs, that is, γt-critical graphs with γt = 3, and characterise the 3t-critical graphs which contain cutvertices
AbstractA dominating set in a graph G is a connected dominating set of G if it induces a connected s...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA set of vertices S is said to dominate the graph G if for each v ∉ S, there is a vertex u ∈...
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...
AbstractLet γt(G) denote the total domination number of the graph G. The graph G is said to be total...
Denote the total domination number of a graph G by γₜ(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...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
A graph G is called domination critical if the removal of any vertex from G causes the domination nu...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domin...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractA dominating set in a graph G is a connected dominating set of G if it induces a connected s...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA set of vertices S is said to dominate the graph G if for each v ∉ S, there is a vertex u ∈...
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...
AbstractLet γt(G) denote the total domination number of the graph G. The graph G is said to be total...
Denote the total domination number of a graph G by γₜ(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...
AbstractA graph G with no isolated vertex is total domination vertex critical if for any vertex v of...
A graph G is called domination critical if the removal of any vertex from G causes the domination nu...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
AbstractA graph is called γ-critical if the removal of any vertex from the graph decreases the domin...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractA dominating set in a graph G is a connected dominating set of G if it induces a connected s...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractA set of vertices S is said to dominate the graph G if for each v ∉ S, there is a vertex u ∈...