International Journal of Mathematics Trends and Technology (IJMTT) – Volume 66 Issue 9 - Sep 2020

Total Domination Number in Graphs and

Graph Modification
V.Anithakumari#1, M.Padmini*2
#1
Assistant Professor, Department of Mathematics, Muslim Arts College, Tamilnadu, India
*2Research Scholar, Department of Mathematics, Muslim Arts College, Tamilnadu, India

Abstract — The major purpose of this paper is to study the effect that various graph modifications have on the
total domination number of a graph. In addition, we study the effect that the operation of edge lifting has on the
domination number of a graph. We finish this work with a study of the total domination number of diameter two
graphs and the relationship between the total domination number of a graph and its total destruction number.

Keywords — Dominating Graph, Stable Graphs, Edge Critical Graphs, Domination Number.

I. INTRODUCTION

Graph theory in mathematics means the study of graphs. The basic idea of graphs was first introduced in
the 18th century by Swiss mathematician Leonard Euler. A graph in this context is made up of vertices (also
called nodes or points) which are connected by edges (also called links or lines). Graphs are one of the prime
objects of study in discrete mathematics. In general, a graph is represented as a set of vertices connected by
edges.
Graph theory is ultimately the study of relationships. Given a set of nodes and connections, which can
abstract anything from city layouts to computer data, graph theory provides a helpful tool to quantity and
simplicity the many moving parts of dynamic systems.
The dominating graph of a graph is the graph with the vertex set where s is the set of all
minimal dominating sets of in which two vertices and are adjacent if and is a minimal
dominating set in containing .

II. TOTAL DOMINATING GRAPHS

The definition of dominating graph of a graph inspired us to define the following graph valued function
in domination theory.
A. Definitions
Let G = (V, E) be a graph. Let S be the set of all minimal total dominating sets of G. The total
dominating graph Dt(G) of G is the graph with the vertex set V ∪ S in which two vertices u and v are adjacent if
u ∈ V and v is a minimal total dominating set of G containing u.
1) Definition
A graph consists of a finite non-empty set of points together with a prescribed set
of unordered pairs of distinct elements of . is called the vertex set and is known as the edge
set of .The elements of are called vertices and the elements of are called edges.
2) Definition
A graph without loops (an edge with identical ends) and multiple edges (more than one edge joins the
same pair of vertices) is called a simple graph.
3) Definition
A caterpillar is a tree with the property that the removal of its and points leaves a path.
4) Definition
In graph theory a critical graph is a graph in which every vertex or edge is a critical element that is, if its
deletion decreases the chromatic number of , such a decrease Cannot be by more than 1.

5) Definition
An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.
6) Definition
A vertex of a graph is said to be pendant if its neighbourhood contains exactly one vertex.
7) Definition

ISSN: 2231-5373 http://www.ijmttjournal.org Page 99

 International Journal of Mathematics Trends and Technology (IJMTT) – Volume 66 Issue 9 - Sep 2020

Double star is the graph obtained by joining the center of two stars and with an edge.
8) Definition
In a connected graph, it’s possible to get from every vertex in the graph to every other vertex in the graph
through a series of edges called a path.
9) Definition
An isolated vertex is a vertex with degree zero, ie) a vertex is not an endpoint of any edge.
10) Definition
A set of vertices in a graph is called a dominating set if every vertex is either an

element of or is adjacent to an element of . A set of vertices in a graph is called a total

dominating set if every vertex is adjacent to an element of .

B. Dominations and Total Dominations
A set D ⊆ V is called a dominating set if every vertex in V − D is adjacent to some vertex of D. Notice that
D is a dominating set if and only if N[D] = V . The domination number of G, denoted γ = γ(G), is the cardinality
of a smallest dominating set of V . We call a smallest dominating set a γ-set. A set S ⊆ V is a total dominating
set if every vertex in V is adjacent to some vertex of S. Alternatively, we may define a dominating set D to be a
total dominating set if G[D] has no isolated vertices. The total domination number of G, denoted γt = γt(G), is
the cardinality of a smallest total dominating set, and we refer to such a set as a γt-set. An immediate
consequence of the definitions of domination number and total domination number is that, for any graph G, γt ≥
γ.
C. Characterizations of Total Domination Number
Total domination number is easily computed for several families of graphs. First, we make the
following observation. Observation 1.7.1. Let G be a graph of order n with no isolated vertices. If ∆ ≥ n − 2,
then γt = 2. Graphs for which Observation in applies include stars and complete graphs. Other graphs with γt = 2
include binary stars and complete bipartite graphs. In general, however, the problem of calculating the total
domination number in bipartite graphs remains difficult [20]. Total domination number is easily calculated for
cycles and paths.
III. CRIT ICAL AND STABLE GRAPHS UPON EDGE REMOVAL

In our investigation of graphs that are stable or critical after the deletion of an edge, we say that
if the graph G, has an isolated vertex. For instance if we delete a pendant edge
then .We say that a graph G is total domination edge stable or -stable for short,
if the removal of any edge of G does not change the total domination number, that is,
for every edge . If and G is -stable, we say that G is stable. We say that G is
total domination edge critical or –critical for short, if the removal of any edge in the graph changes the
total domination number, that is, for every edge .
We note that removing an edge from a graph cannot decrease the total domination number. Hence if
G is -critical, then for every edge An edge eE(G) is a stable edge of
G if  while e is a critical edge of G is . Thus every edge in a
stable graph is a stable graph is a stable edge while every edge in a critical graph is a critical
edge.A vertex in G is called a -good vertex if v is in some - (G)-set, and we define to be
the set of all - good vertices of G.

A. Total Domination Edge Critical Graphs

1) Definition:

ISSN: 2231-5373 http://www.ijmttjournal.org Page 100

 International Journal of Mathematics Trends and Technology (IJMTT) – Volume 66 Issue 9 - Sep 2020

A tree if T is a non trivial star, or a double star, or if T can be obtained from a

subdivided star where by adding zero or more p endant edges to the non-leaf vertices of
.

Lemma
If is a –critical graph, then for every )-set is a galaxy of nontrivial stars.
Proof
Let S be any -set in the critical graph G, and let
Let e be an arbitrary edge in Gs.If both ends of e have degree at least 2 in Gs, then S is a TDS in
G-e,
and so,
Which is a contradicting the fact that G is critical.
Hence at least one end of the edge is a leaf in ,
is a galaxy of nontrivial stars.

B. Total domination Edge Stable Graphs

If is a graph with an isolated vertex, then .Thus if is an edge of a graph incident
with a leaf, then

Proposition:
A graph is -stable if and only if and for each there exists set
such that one ofthe following conditions are satisfied.
(a)
(b)
(c) Without loss of generality, if and v , then

Proof:
Assume that is –stable.
We know that, If is -stable then .
Let be an arbitrary edge of . Let and let be any set. We
know that, the set is a set. If then the set set.
Therefore u,v S
(a) holds.
Now we assume that, ,If ,then since is a TDS for ,

(b) holds.
If ,then since is a TDS for ,
and
(c) holds.
Now we assume that and for each there exists a set
In all the three conditions (a), (b),(c) are the set is also a TDS for
Hence .Consequently .
∴ The graph G is stable.

C. Disjoint Minimum Total Dominating Sets

1) Corollary:
If a bipartite graph G has two disjoint -sets, then is –stable.

Proof:
We have let G be a bipartite graph, then G is –stable if and only if for every vertex v in
G,

ISSN: 2231-5373 http://www.ijmttjournal.org Page 101

 International Journal of Mathematics Trends and Technology (IJMTT) – Volume 66 Issue 9 - Sep 2020

This shows that a bipartite graph G has two disjoint -sets, then is –stable is not true for general
graphs.
However if G is a graph with three pairwise disjoint -sets, and if
Then atleast one of these three -sets does not contain an end of and is therefore also a TDS in
Consequently, for every
∴ G is a –stable graph.
Hence a bipartite graph G has two disjoint -sets, then is –stable.

IV. TOTAL DOMINATION STABLE GRAPHS UPON EDGE ADDITION

In such graphs the total domination number remains unchanged upon the addition of any edge. We
say that a graph G is total domination edge addition stable, or -stable for short, if the addition of any edge
to does not change the total domination number. In other words, for every
edge . We note that adding an edge to a graph cannot increase the total domination number.
Hence for every edge
Since for every and for every isolate free graph G, ,
we note that If , then G is -stable. Accordingly, the graphs G for which We
construct -stable graphs having a specified total domination number and induced subgraph.
Lemma:
If G is a -stable graph and then for every set s and for every one of the
following properties hold,
(a) |pn(v,s)|  2 and |epn(v,s)|  1.
(b) If epn(v,s)= ,then

Proof:
Let G be a -stable graph with .
Suppose that S is a set,and that We have, If S is a minimal TDS of a connected graph G,
then for each vertex or
If pn(v,s)= ,then the set s/ is a TDS G+uw,where and so G is not -stable.
Which is a contradiction. if Now we may assume
that, If ,then the set s/ is a TDS for G+xy of cardinality
.
G is not -stable.Which is also a contradiction.
Hence
Hence proved.

A. Total Domination Changing and Stable Graphs Upon vertex

1) Definition

For a graph G, we define a weak partition of its vertex

set, where

ISSN: 2231-5373 http://www.ijmttjournal.org Page 102

 International Journal of Mathematics Trends and Technology (IJMTT) – Volume 66 Issue 9 - Sep 2020

In a graph G is defined to be total domination vertex removal critical or critical for short, If
for every vertex
2) Definition

A graph G is changing if for every vertex , while a graph

G is for every vertex .

B. properties of vertices

Proposition:

Let G be a graph without isolated vertices. A vertex v is in iff there exists some -
set s and a vertex such that and pn(u,s)=
Proof:

Let G be a graph without isolated vertices, And let

Let be an arbitrary -set and let

By previous knowledge,
and
Thus is a -set, such that and pn(u,s)= .
Conversely, assume that there exists a -set s and such that and pn(u,s)= for some .
The set is a TDS for G-V of cardinality .
Hence .

C. - Changing Graphs

In -changing graphs G with .The only connected -changing graph G

with is G= . Further the -changing graphs G with are precisely
the -critical graphs with minimum degree at least two.

1) Definition

Let F be the family of all graphs G that can be obtained from a connected graph H, where every
support vertex of H is a strong vertex, by adding a new vertex and an edge to every vertex v in H
that is not a support vertex.

2) Definition

Let H be the family of all graphs G that can be obtained from a connected graph F , by adding to
every vertex v in F two disjoint copies of and adding an edge from v to one vertex in each copy of

Theorem: 5.3.4
If G is a connected -changing graph of order n with and ,then

Furthermore the following holds,

iff G= ,for some connected graph H with

iff .

Proof:
Let G be a graph as defined in the hypothesis.
Let G be a connected -changing graph. Then iff .

ISSN: 2231-5373 http://www.ijmttjournal.org Page 103

 International Journal of Mathematics Trends and Technology (IJMTT) – Volume 66 Issue 9 - Sep 2020

Thus G is constructed from a connected graph H, where every support vertex of H is a strong
support vertex by adding to every vertex in H that is not a support vertex a new vertex and an edge .
If H=K then and
Hence we may assume that │V(H)│ with this assumption, the graph G satisfies the five
properties:
(a) and
(b) is the unique -set.
(c) Every support vertex of G is adjacent to exactly one leaf.
(d) No support vertex of G is a support vertex of H.
(e) Every vertex of H that is not a support vertex of G is a strong support vertex of H.

V. CONCLUSION

In this paper I have explained the concept of fundamentals of graphs and as well as the critical and
stable graphs. And also explained the concept of total domination stable graphs upon edge and vertex
addition. Finally we conclude the total domination changing and stable graphs upon vertex. None of the
concept is difficult but there is an accumulation of new concepts which may sometimes seems heavy.

ACKNOWLEDGMENT
The authors would like to thank the reference for given that very helpful comments and suggestions, their
insight and comments led to a better presentation of the idea expressed in this paper. This research work was
supported by the university Grant Commission, Ne Delhi.

REFERENCES
[1] Abdulgani sahin e.al (2020), Total Edge- Vertex Domination, Theatrical Information and Application, Vol:4, Issue:2,pp:123-129.
[2] Al-Harere et.al (2019), Change of Tadpole domination number upon changing of Graph, Journal of Science And Integellince, Vol:31,
Issue 2,pp:197-199.
[3] Bauer .D et al (2012), Domination alteration sets in graphs, Discrete Applied Mathematics, Vol:1, Issue:2 ,pp:1143-1151.
[4] Bohdan Zelinka et al (2019), Signed Total Domination Number of a Graph, Journal of Mathematics , Vol 51,Issue:26,pp:225-229.
[5] Haynes T.W et al(2012), External 2-2 insensitive graphs, Discrete Applied Mathematics, Vol:10,Issue:7,pp:1143-1151
[6] Haynes T.W et.al (2018), External graphs domination insensitive to the removal of k-edges, Applied Mathematics, Vol:5,
Issue:2 ,pp:114-119.
[7] Kulli V.R(2015), The Total dominating Graph ,Annals of Pure and Applied Mathematics , Vol:10,Issue:1,pp:123-128.
[8] Latheesh Kumar e al (2016), A Note on Global Bipartite Domination in Graph, Malaya Journal Matemaik, Vol:4, Issue:3, pp:438-442.
[9] Meenal et al (2019), Average Total Domination Number on Graph, International Journal of Emerging Technologies and Innovative
Research, Vol:1, Issue 1,pp:54-66.
[10] Manjusha et al (2015), Strong domination in Fuzzy Graph, Academic Research paper on Mathematics ,Vol:7, pp:369-377.
[11] Nader Jefari Rad et al (2012), On Alpha total domination in graph, Discrete Applied Mathematics, Vol:10,Issue:7,pp:1143-1151.
[12] Ramy Shaheen et.al (2017),On the 2-Domination Number of Complete Grid Graph, Open Journal of Discrete Mathematics,
Vol:7,No:1,
[13] Radha Rajamani Iyar (2014), The co-total domination number of a graph, Journal of Discreate Mathemaical Science and
cryptography, Vol:2, Issue:2, pp123-128.

ISSN: 2231-5373 http://www.ijmttjournal.org Page 104