A STUDY ON CO EDGE INDEPENDENT

DOMINATION GRAPH
Dissertation submitted to BHARATHIDASAN UNIVERSITY,

Trichirappalli in partial fulfillment for

the award of the degree of

MASTER OF SCIENCE IN MATHEMATICS

Submitted by

AASHLIN. CJ

(Reg. No. P 23051976511012003)

Under the Guidance of

Dr. P. JAYAGOWRI, M.Sc., M.Phil., P.G.D.C.A., Ph.D.,

Associate Professor of Mathematics

PG AND RESEARCH DEPARTMENT OF MATHEMATICS

SUDHARSAN COLLEGE OF ARTS AND SCIENCE
(Affiliated to Bharathidasan University, Trichy)
PERUMANADU, PUDUKKOTTAI-622104

APRIL -2025
Dr.P.JAYAGOWRI, M.Sc., M. Phil., P.G.D.C.A., Ph.D.,
Associate Professor,
PG and Research Department of Mathematics,
Sudharsan College of Arts and Science,

Perumanadu, Pudukkottai District-622104.

CERTIFICATE
This is to certify that the dissertation entitled “A STUDY ON CO EDGE
INDEPENDENT DOMINATION GRAPH” done under my guidance and submitted in the
Sudharsan College of Arts and Science affliated to Bharathidasan University,is partial
fulfillment of the requirements for the award of the Degree of MASTER OF SCIENCE is
a bonafide record of the work done by

AASHLIN. CJ

(Reg. No. P 23051976511012003)

In PG and Research Department of Mathematics, Sudharsan Colleges of Arts and Science,

Perumanadu, Pudukkottai, during the period 2024-2025.

Signature of HOD Signature of Guide

Signature of Examiner
 ACKNOWLEDGEMENT

Acknowledgement is a place, where gratitude is shown to the people who were with
me for the successful completion of the dissertation.

First of all I express my deep sense of gratitude to GOD ALMIGHTY because

without his blessings nothing can be done.

I would like to express my sincere thanks to my esteemed Chairman

Mr. AR. S. SUBRAMANIAN and Secretary Mr. VENKAT RAMASAMY, Sudharsan
College of Arts and science, Perumanadu, Pudukkottai.

I sincerely thanks to Managing Director Mrs. PADMAPRIYA ALAGAPPAN,

Sudharsan College of Arts and Science, Perumanadu, Pudukkottai.

I express my sincere thanks to our principal and Guide Dr. P. JAYA GOWRI,
Sudharsan College of Arts and Science, Perumanadu, Pudukkottai.

I wish to express my sincere thanks and grateful to the Head of the Department of
Mathematics Mr. R. BEEMARAJAN, for her encouragement in completing this project
work.

Finally I thank all the staff members, my parents, my family members and my
friends and all well wishers for the constant support to complete my research work

(AASHLIN. CJ)
 CONTENTS

CHAPTER TITLE PAGE NO

INTRODUCTION 01

I PRELIMINARIES 02

II SHORTEST PATH PROBLEM 19

III CRITICAL PATH METHOD (CPM) 42

IV PERT 58

CONCLUSION 64

REFERENCES 65
Contents

1. Introduction ………………………………….. 1

2. Edge domination in splitting graphs ……….. 9

3. Co-regular edge domination in graphs …….. 21

4. The edge domination number of connected

graphs ……………………………………….. 33

5. The co-edge independent domination

number of a graph …………………………. 41

References …………………………………. 51

1
 1 INTRODUCTION

In chapter two, the domination in graphs is one of the concepts in graph theory which has

attracted many researchers to work on it. Many variants of domination models are available in

the existing literature: edge domination, total domination, global domination, and cycle

domination, just to name a few. For a comprehensive bibliography of papers on the concept of

domination, the readers are advised to refer to Hedetniemi and Laskar[25]. The present work is

focused on edge domination in graphs.

We begin with simple, finite, connected, and undirected graph G = (V, E) of order n. A

set S  V of vertices in a graph G is called a dominating set if every vertex v V is either an

element of S or is adjacent to an element of S. A dominating set S is a minimal dominating set

(MDS) if no proper subset S '  S is a dominating set.

The minimum cardinality of a dominating set of G is called domination number of G

which is denoted by  (G) and the corresponding dominating set is called a   set of G.

The open neighborhood N(v) of v V is the set of vertices adjacent to v, and the closed

neighborhood of v is the set N[v] N (v) {v}.

An edge e of a graph G is said to be incident with the vertex v if v is an end vertex of e.

In this case, we also say that v is incident with e. Two edges are adjacent, if they have an end

vertex ij common.

2
 A subset F  E is an edge-dominating set if each edge in E is either in F or is adjacent

to the edge in F. An edge-dominating set F is called a minimal edge-dominating set if no proper

subset F’ of F is an edge dominating set. The edge domination number  '(G) is minimal

cardinality among all minimal edge dominating sets. The concept of edge domination was

introduced by Mitchell and Hedetniemi [17] and it was studied by Arumugam and Velammal [2].

Yannakakis and Gavril [22] proved that edge dominating set problem for graphs in NP-

complete even when restricted to planar or bipartite graphs of maximum degree 3 while bipartite

or graphs with equal edge domination number and maximum matching cardinality are

characterized by Dutton and Klostermeyer [30]. Complementary edge domination in graphs is

studied by Kulli and Soner [17] while Jayaram [25] studied the line-dominating sets and obtained

bounds for the line domination number. Edge domination in graphs of the cube of dimension n is

studied by Zelinka [32] while a constructive characterization for trees with equal edge

domination and end edge domination numbers was investigated by Muddebihal and Sedamkar

[22]. The concept of fractional edge domination graphs was explored by Arumugam and Jerry

[3]. The wheel Wn is defined to be the join Cn-1+K1. The vertex corresponding to K1 is known as

apex vertex and the vertex and the vertices corresponding to the cycle are known as rim vertices.

The edges corresponding to the cycle are known as spoke edges.

The complete bipartite graph K1,n is known as the star graph. We identify the vertex of

degree n as the apex of K1,n .

For any real number n, n denotes the smallest integer not less than n and n denotes

the smallest integer not greater than. Throughout this chapter, Pn, Cn, Wn, and K1,n will denote the

path, the cycle, the wheel and the star graph respectively.

3
 In chapter three, By a graph G=(V,E) be mean of finite undirected graphs without loops

or multiple edges. Terms not here are used in the sense of Harary [8].

As usual the maximum degree of a vertex in V(G) is denoted by (G) and maximum

edge degree of edge in E(G) is denoted by  '(G) . The notation 0 (G) (1 (G)) is the minimum

number of vertices (edges) in the vertex (edge) cover of G. The notation 0 (G) (1 (G)) is the

maximum cardinality of a vertex (edge) independent set in G. A subset D of V is a dominating

set of G, If every vertex not in D is adjacent to some vertex in D. The domination number  0 (G)

of G is the minimum cardinality taken over all dominating sets of G. The study of domination

graphs was begun by Ore [25] and Berge [5].

A dominating set S of G is said to be a connected dominating set if the subgraph S is

connected in G. The minimum cardinality of vertices in such a set is called the connected

dominating number, of G and denoted by  c (G) .

A dominating set S of G is said to be a total dominating set if the subgraph S has no

isolated vertices in G. The minimum cardinality of vertices in such a set is called total

 t (G) see [7].

dominating number, of G and denoted by

The concept of restrained domination in graphs was introduced by Domke et.al (1999)

see [6]. A dominating set S  V (G) is restricted dominating set of G, if every vertex not in S is

adjacent to a vertex in S and to a vertex in V(G)-S. The restricted domination number of graph G

 t (G) is the minimum cardinality of a restrained dominating set in G.

is denoted by

4
 A dominating set D of a graph G = (V, E) is a split dominating set if the induced

subgraph V  D has more than one component. The split domination number  s (G) of G is

the least cardinality of a split dominating set. The concept of domination was introduced in [16].

A restrained dominating set D  V (G) is a co-regular restrained dominating set if the

induced subgraph V  D is a regular. The co-regular restrained domination number of G is

denoted by  crr (G) is the minimum cardinalty of a co-regular restrained dominating set. For

detail see [20].

A dominating set D of a graph G is a global dominating set if D is also a dominating set

 (G)
of G . The global domination number g is the minimum cardinality of a global dominating

set of G.

The concept of Roman domination function (RDF) in a graph G = (V,E) is a function

f : V  {0,1, 2}
satisfying the condition that every vertex u for which f(u)=0 is adjacent to

atleast one vertex of v for which f(v)=2 in G. The weight of a Roman dominating function is the

f (V )   f (u) . The minimum weight of a Roman domination function of a graph G is

value uv

 g (G)
called Roman domination number and is denoted by .

A dominating set D  V (G) is a double dominating set of G, if each vertex in V is

 dd (G) of G is the
dominating by a at least two vertices in D. The double domination number

minimum cardinality of a double dominating set of G see [9].

5
 Analogously, a split dominating set D of a graph G is a co-regular split dominating set if

the induced subgraph V (G)  D is disconnected and regular. The co-regular split dominating

number  crs (G) is the minimum cardinality of a co-regular split dominating set of G. For details

see [19].

A total dominating set D of a graph G is a co-regular total dominating set if the induced

subgraph V  D is regular. The co-regular total dominating number

 crt (G) of G is the

minimum cardinality of a co-regular total dominating set see [21].

The concept of edge domination was introduced and studied in [2, 18].

In this chapter, we obtain many bounds on  'cr (G) in terms of elements of G. Also its

relation with other domination parameters were established.

In chapter 4, we limit our discussion to graphs that are simple and finite. For the most

part, our notation and terminology follows that of Chartrand and Zhang [11]. Let G = (V, E)

denote a graph with vertex set V=V(G) and edge set E=E(G) we use S to denote the cardinality

of a set S. We define n = V (G) to be the order of G and m= E(G) to be the size of G. We

simply write e = uv for the edge e that join the vertices u and v. We say that u and v are joined by

the edge e. The vertex u and the e (as well as u and v) are said to be incident with each other.

A distinct edge of G induced by X is called an edge induced subgraph of G. A graph G is

complete if every two distinct vertices of G are adjacent. A complete graph of order n is denoted

by Kn. A graph G is a bipartite graph if V(G) can be partitioned into two subsets U and W, called

partite set, such that every edge of G joins a vertex of U and a vertex of W. We call G a complete

bipartite graph if every vertex of U is adjacent to every vertex of W. A complete bipartite graph

6
with U  s and W  t is denoted by Ks,t or Kt,s. If either s=1 ort=1, then Ks,t is star. A graph G

is called acyclic if it has no cycle. A tree is an acyclic connected graph. A subset M of the edge

set E of a graph G = (V, E) is an independent edge set or matching in G if no two distinct edges

in M have a common vertex. For a graph G and X  E(G) we denote by G-X the graph obtained

from by removing all edges in X. If X={e}, we write G-e for G-{e}. For X  E(G) , G+X

denotes the graph obtained from G by adding all edges in X. If X = {e} simply write G+e for

G+{e}. For a proper subset X of V(G), G-X is graph obtained from G by removing all vertices in

X and all edges incident with vertices in X. Necessarily, G-X is an induced subgraph of G;

indeed, G-X = V (G)  X .

In fifth chapter, By a graph G = (V, E) we mean a sample finite undirected graph.

Unless otherwise stated the graph has p-vertices and q-edge. Terms not defined here are used in

the sense of Harary [8]. The concept of edge domination was introduced by Mitchell and

Hedetniemi in [17] and further studied by Arumugam and Velammal in [2]. In [17], a set X E

is said to be an edge dominating set (ed-set) of G if every edge in E\X is adjacent to some edge

in X. The minimum cardinality of an ed=set of G is called the edge domination number of G and

is denoted by  '(G). In [2], an ed-set X of G is said to be an independent edge dominating set

(ied-set) if no two edges in X are adjacent. The minimum cardinality of a ied-set of G is called

the independent edge domination number and is denoted by  'i (G). In [32], an ed-set X of G is

said to be a co-edge split dominating set (cest-set) if the edge induced subgraph E \ X is

disconnected. The minimum cardinality of a cesd-set of G is called the co-edge split domination

number and is denoted by  'ces (G). In [32], an ed-set X of G is said to be a co-edge non-split

dominating set (censd-set) if the edge induced subgraph E\X is connected. The minimum

7
cardinality of G is called the co-edge non-split domination number and is denoted by  'cens (G).

We call a set of edges as  ' -set if it is an ed-set with cardinality  '(G). Similarly,  ' -set,  'ces -

set and  'cens -set are defined.

The degree of an edge e = uv of G is defined by deg(e) = deg(u) + deg(v) – 2. The

maximum and minimum edge degree of the graph G is denoted by  '(G) and  '(G) respectively.

An edge is said to be isolated if its degree 0 and pendant if any one of its end vertex has its

degree 1. The subdivision graph S(G) of a graph G is obtaining by subdividing each edge of G

exactly once.

The purpose of this chapter is to introduce the concept of co-edge independent

domination number for simple connected graphs. We found many bounds for co-edge

independent domination number and we obtain its exact values for some standard graphs. Also,

we investigate its relationship with other parameters.

8
 2 EDGE DOMINATION IN SPLITTING GRAPHS

For a graph G = (V, E) , a subset of F of E is called dominating set of G if every edge not

in F is adjacent to some edge in F. The edge domination number  '(G) of G is a minimum

cardinality of an edge dominating set in G. In this chapter, we investigate edge domination

number of splitting graph of some standard graphs.

We will provide brief summary of definitions which are useful for the present

investigations.

Definition 2.1

For each e  E, N(e) denotes the open neighborhood of e in G. That is, the set of

all edges which are adjacent to e in G. Further, N[e]  N(e) {e} is the closed neighborhood of e

in G.

Definition 2.2

The degree of an edge e=uv of G is defined by deg(e)  deg(u)  deg(v)  2 that is, the

number of edges adjacent to it. The maximum degree of an edge in G is denoted by  '(G)

For the various graph theoretic notations and terminology, we follow West [6] while the

terms related to the concept of domination are used in the same sense of Haynes et.al. [30].

We will provide brief summary of definitions which are useful for the present

investigations.

9
Definition 2.3

Duplication of a vertex v of graph G produces a new graph G’ by adding a vertex v’ with

N(v’) = N(v). In other words, a vertex v is said to be duplication of v if all the vertices which are

adjacent to v are now adjacent to v’ also.

Definition 2.4

If the vertices of the graph G are duplicated altogether then the resultant graph is known

as splitting graph of G, which is denoted as S’(G).

Theorem 2.1 [26]

An edge dominating set S id minimal if and only if for each e  S, one of the following

two conditions holds:

(a) N (e)  S  

(b) There exists an edge f  E  S, such that N( f )  S  e.

Theorem 2.2

n
Let S’(Pn) be the splitting graph of path Pn. Then  '(S '(P )  .
n 2


Proof:

Let v1, v2, …, vn be the vertices of path Pn which are duplicated by the vertices v’1, v’2,…

v’n respectively and let e1, e2,…,en-1 be the edges of Pn. Then the resultant graph S’(Pn) will have

2n vertices and 3(n-1) edges.

10
Now, we construct an edge set of S’(Pn) as follows:

{e1, e3 , e5 ,..., e2i+1} if n is even

F  
{e1, e3 , e5 ,..., e2i+1}e2i+1 if n is odd

n  2 n
For 0  i  with F  .
 2   2 

Since each edge in E(S’(Pn) is either in for adjacent to an edge in F, the above set F is an edge

dominating set of S’(Pn)

Moreover, for each edge e  F , there exist an edge f  E(S '(Pn ))  F for which

N ( f )  F  {e}. Therefore, by theorem 2.1., the set F is minimal edge dominating set of S’(Pn).
 n  3
Now, deg(e )  6  '(S'(P )) for 0i , n  5, and
 2 
2i1 n

 n  3
deg(e )  6  deg(e )  '(S '(P ))  2 and the edges e2i+1 for 0  i  being non
 2 
2i1 n1 n

adjacent to each other, will dominate maximum distinct edges of S’(Pn). Therefore, the above set

n .
F is of minimum cardinality Hence, the above set F is of minimal dominating set with
 2 
n
minimum cardinality among all minimal edge dominating sets of S’(Pn). Thus,  '(S '(P )  .
n
 2 

11
Theorem 2.3

n
Let S’(Cn) be the splitting graph of cycle Cn. Then  '(S '(P )  .
n
 2 


Proof:

Let v1, v2, …, vn be the vertices of cycle Cn which are duplicated by the vertices v’1,

v’2,… v’n respectively and let e1, e2,…,en be the edges of Cn. Then the resultant graph S’(Cn) will

have 2n vertices and 3n edges.

Now, we construct an edge set of S’(Cn) as follows:


F  n 1
{e1 , e3 , e5 ,..., e2 i1}, where 0  i  .
 2 



The above set F is an edge domination set of S’(Cn) because each edge in E(S’(Cn)) is

either in F or adjacent to an edge in F. Moreover, for each edge e  F there exist an edge

f  E(S '(Cn ))  F for which N ( f )  F  {e}. Therefore, by theorem 2.1., the set F is minimal

edge dominating set of S’(Cn). Now, each edge in the set F is of minimum degree in S’(Cn) and
 n  1
the edges e2i+1 for 0  i  being non adjacent to each other, will dominate maximum
 2 

n
distinct edges of S’(Cn). Therefore, the above set F is of minimum cardinality . Hence, the
 2 

above set F is a minimal edge dominating set with minimum cardinality among all minimal edge

n
dominating sets of S’(Cn). Thus,  '(S '(Cn ))  F  . as required.
2

12
Theorem 2.4

n
Let S’(Wn) be the splitting graph of wheel Wn. Then  '(S '(W ))  .
n 2


Proof:

Let v1, v2, …, vn-1 be the rim vertices of wheel Wn which are duplicated by the vertices

v’1, v’2,… v’n-1 respectively and let c denotes the apex vertex of Wn which is duplicated by by

the vertex c’. Let e1, e2,…,en-1 be the rim edges of Wn. Then the resultant graph S’(Wn) will have

2n vertices and 5(n-1) edges.

Now, we construct an edge set of S’(Wn) as follows:


F  n  2 
 1 3 5
{e , e , e ,..., e2 j 1}, where 0  j  .
  2 


Since each edge in E(S’(Wn) is either in F or adjacent to an edge in F, the above set F is

an edge dominating set of S’(Wn)

Moreover, for each edge e  F , there exist an edge f  E(S '(Wn ))  F for which

N ( f )  F  {e} therefore , by theorem 2.1., the set F is minimal edge dominating set of S’(Wn).
n  2
Now, deg(e )  10 for 0 j and from the nature of graph S’(Wn). Therefore, the
2 j 1
 2 

n
above set F is of minimum cardinality . Hence, the above set F is a minimal edge dominating
 2 
 

set with minimum cardinality among all minimal edge dominating sets of S’(Wn). Thus,
n
 '(S '(W )  .
n 2

13
Theorem 2.5

Let S’(K1,n) be the splitting graph of star K1,n. Then  '(S '(K1,n ))  2.

Proof:

Let v1, v2, …, vn-1 be the pendent vertices of star K1,n which are duplicated by the vertices

v’1, v’2,… v’n-1 respectively and let c be the apex vertex of K1,n which is duplicated by the vertex

c’. Then the resultant graph S’(K1,n) will have 2(n+1) vertices and 3n edges.

Now, in S’(K1,n), an edge with incident with the vertex c and an edge incident with the

vertex c’ will dominate all the edges incident with the vertex c and with the vertex c’

respectively. Therefore, two such edges are enough to dominate all the edges of S’(K 1,n).

Therefore any edge dominating F of S’(K1,n) must have at least two such edges for its minimum

cardinality. Hence, F  2 which implies that  '(S '(K1,n ))  2 as required.

Definition 2.5

Duplication of an edge e=uv of graph G produces a new graph G’ by adding and edge

e’=u’v’ such that with N (u ')  N (u) {v'} {v} and N (v')  N (v) {u'} {u}.

Definition 2.6

If the edges of graph G are duplicated altogether then the resultant graph is known as

edge splitting graph of G, which is denoted as S’e(G).

14
Theorem 2.5

Let S’e(G) be the edge splitting graph of path Pn. Then

n 1 if n  0 or1(mod 3)
 '(S ' (P )) 
e n 
n otherwise

Proof:

Let v1, v2, …, vn-1 be the vertices of path Pn and let e1, e2,…,en-1 be the edges of path Pn

which are duplicated by the edges e’1, e’2,…,e’n-1 respectively. Then the graph S’e(Pn) will have

(3n-2) vertices and (4n-6) edges.

Let the vertices vi , v ' j , v" j V (S 'e (Pn )) and the edges ek , e 'k , fl , f ' j  E(S 'e (Pn )) for

1  i  n, 2  j  n 1, 1  k  n  1 and 1 l  n  2 where

ek  vk vk 1 , e '1  v '1 v '2 , e 'k  v"k v 'k 1 (2  k  n1), fl v l v'l 1 and f ' j  v ' j v ' j 1 .

Case-I

n  0 (mod 3).

For n = 3, we claim that F = {f1, f’2} is only minimal edge dominating set of P3 with

minimum cardinality because for any e  F the set F-{e} will not be an edge dominating set and

deg( f1 ) deg( f '2 )  2  '(S 'e (P3 )) and all the edges of S’e(P3) dominated by the set F are

distinct. Therefore,  '(S 'e (P3 ))  2 that is,  '(S 'e (Pn ))  n 1 for n = 3.

For n>3, first we construct and edge set of S’e(Pn) as follows:

F  f1, f4 ,..., f3r1, f '2 , f '5 ,..., f '3r2 , e'3, e'6 ,..., e'3t 

15
 n3 n3
where 0  r  , 1 t  .
3 3

The above set F is an edge dominating set of S’e(Pn) as each edge in E(S’e(Pn)) is either in

F or adjacent to an edge in F.

Moreover, for the edge e  F there exists an edge f  E(S 'e (Pn ))  F for which

N (f)  F  {e} Therefore, by Theorem 2.1., the set F is minimal edge dominating set of S’e(Pn).

Further, we claim that at least (n-1) distinct edges are required to dominate the duplicated edges

e’1, e’2,…,e’n-1 of S’e(Pn) because any two of the duplicated edges are not adjacent to each other

and there is no edge which is adjacent to any two of the duplicated edges. Therefore, any edge

dominating set of S’e(Pn) must have at least (n-1) distinct edges. Now, the above set F is a

minimal edge dominating set of S’e(Pn) and

 n  3  n  3 2n  6  6  n  3 3n  3
F 2   1     n 1. Hence, F is a minimal edge
3 3 3 3
 

dominating set with minimum cardinality among all minimal edge dominating sets of S’e(Pn).

Thus, we have proved that  '(S '(Pn )  F  n 1 for n  0(mod3).

Case-II

n 1 (mod 3).

We construct an edge set of S’e(Pn) as follows:

F  f2 , f5 ,..., f3r2 , f '2 , f '5 ,..., f '3r2 , e'2 , e'5 ,..., e'3r2,

n4
where 0  r  .
3

16
 n4   n 1 
F 2 1  3  n  1.
 3   3 
   

By arguments similar to Case-I, we reach to  '(S 'e (Pn ))  F  n 1 for n  1 (mod 3).

Case – III

n  2 (mod 3).

In S’e(Pn), any two of the edges e’1,e’2,…, e’n-1 are not adjacent to each other and also no

edge is adjacent to any two of these edges. Therefore, any edge dominating set F of S’e(Pn) must

contain (n-1) distinct edges to dominate these (n-1) duplicate edges. Moreover, form the nature

of S’e(Pn) where n  2 (mod 3). it can be seen that only (n-1) distinct edges are not enough to

dominate all the edges of S’e(Pn) which implies that F  n 1.

Now, we construct an edge set of S’e(Pn) as follows:

F  f2 , f5 ,..., f3r2 , f '2 , f '5 ,..., f '3r2 ,e '2 ,e '5 ,...,e '3r2 ,e 'n1,en1,

n5
where 0  r  .
3

n5 
Here, F  3  1  2  n  5  3  2  n.
1  3 
 


By the argument similar to Case-I, F is a minimal edge dominating set of S’e(Pn). Since

F  n 1. and here F  n 1. it follows that F  n 1. for n  2 (mod 3).

Thus, we have proved that

17
 n 1 if n  0 or1(mod 3)
 '(S ' (P )) 
e n 
n otherwise

Theorem 2.7

Let S’e(Cn) be the edge splitting graph of the cycle Cn. Then  '(S 'e (Cn ))  n .

Proof:

Let v1, v2, …, vn-1 be the vertices of cycle Cn and let e1, e2,…,en be the edges of cycle

Cn which are duplicated by the edges e’1, e’2,…,e’n respectively. Then the graph S’e(Cn) will

have 3n vertices and 4n edges.

Let the vertices vi , v ' j , v" j V (S 'e (Cn )) and the edges ei , e 'i , fi , f 'i  E(S 'e (Cn )) for I =

1, 2,,…,n where fj = vjv”j+1 for 1  j  n  1, fn = vnv’1, f’j = vj+1v’j for 2  j  n  2, fl  v2 v'1 ,

f 'n  v1v 'n .

Now, we construct an edge set F = {f1, f’2, f’3,…, f’n-1, f’n}.

Since Each edge in E(S’e(Cn)) is either if F or adjacent to an edge in F, the above set F is

an edge dominating set of S’e(Cn).

Moreover, for each edge e  F , there exists an edge E '2  E2 for which E '2  E2 .

Therefore, by Theorem 2.1., the set F is minimal edge dominating set of S’e(Cn). Further, we

claim that at least n distinct edges are required to dominate the duplicated edges e’1, e’2, e’3,…,

e’n of S’e(Cn) because any two of the duplicated edges are not adjacent to each other and also no

edge is adjacent to any two duplicated edges. Therefore, any edge dominating set of S’e(Cn) must

have at least n distinct edges. Now, the above set F is a minimal edge dominating set of S’e(Cn)

18
and F  n Hence, F is a minimal edge dominating set with minimum cardinality among all

minimal edge dominating sets of S’e(Cn). Thus  'S’e Cn   n as required.

Theorem 2.8

Let S’e(Wn) be the edge splitting graph of the wheel Wn. Then  '(S 'e (Wn ))  2  n 1 .

Proof:

Let v1, v2, …, vn-1 be the vertices of rim vertices of Wn and c be the apex vertex of Wn.

Let e1, e2,…,en-1 be the rim edges of Wn which are duplicated by the edges e’1, e’2,…,e’n-1

respectively and let f1, f2,…, fn-1 be the spoke edges of Wn which are duplicated by the edges f’1,

f’2,…f’n-1 respectively.

Now, from the nature of S’e(Wn), we observe that at least 2(n-1) distinct edges are

required to dominate the duplicated edges of S’e(Wn) because

(i) None of the edges e’1, e’2,…,e’n-1 of S’e(Wn) are adjacent to each other.

(ii) None of the edges f’1, f’2,…f’n-1 of S’e(Wn) are adjacent to each other.

(iii) There is no edge which is adjacent to any two of the edges e’1, e’2,…,e’n-1 of

S’e(Wn).

(iv) There is no edge which is adjacent to any two of the edges f’1, f’2,…f’n-1 of

S’e(Wn).

(v) There are total 2(n-1) duplicated edges of S’e(Wn).

19
 Since these 2(n-1) edges can also dominate the remaining edges of S’e(Wn), it follows

that any edge dominating set F of edges of S’e(Wn) must have at least 2(n-1) distinct edges of

S’e(Wn). Hence F  2  n 1 which implies that  '(S 'e (Wn ))  2  n 1 as required.

Theorem 2.9

Let S’e(K1,n) be the edge splitting graph of star K1,n. Then  '(S 'e (K1,n ))  n

Proof:

Let v1, v2,…,vn be the pendent vertices of star K1,n and let c denotes the apex vertex of

K1,n. Let e1, e2,…,en be the pendent edges of K1,n which are duplicated by the edges e’1, e’2,…,e’n

respectively. Then the resultant graph S’e(K1,n) will have (3n-1) vertices and n(n+1) edges.

Now, from the nature of S’e(K1,n), we observe that at least n distinct edges are required to

dominate the duplicate edges of S’e(K1,n) because

(i) None of the edges e’1, e’2,…,e’n-1 of S’e(K1,n) are adjacent to each other.

(ii) There is no edge which is adjacent to any two of the edges e’1, e’2,…,e’n-1 of

S’e(K1,n).

(iii) There are total n duplicated edges of S’e(K1,n).

Since these n edges can also dominate the remaining edges of S’e(K1,n), it follows that

any edge dominating set F of S’e(K1,n) must have at least n distinct edges of S’e(K1,n). Hence,

F  n implying that  '(S 'e (K1,n ))  n.

20
 3 CO-REGULAR EDGE DOMINATION IN

GRAPHS

An edge dominating set D is a co-regular edge dominating set of G. If the induced

subgraph E(G)  D is regular. The co-regular edge domination number  'cr (G) is the

minimum cardinality of a co-regular edge dominating set. In this chapter, we establish upper and

lower bounds on  'cr (G) and compare with other dominating parameters G and elements of G

were obtained.

MAIN RESULTS

Theorem 3.1

p3
a]. For any path Pp with vertices,

 p
 ' (P )  1.
cr p
 2 


b]. For any cycle Cp with p  3vertices,

 p
 ' (C )  .
cr p
 2 

p3
c]. For any star K(1,p) with vertices,

 'cr (K(1, p) )  q 1.

d]. For any wheel Wp with p  4 vertices,

21
  'cr (Wp )  p 1.

Theorem 3.2

 ' (G)  m  0 (G)

For any connected (p,q) graph G with p  3 vertices, cr

Where m be be the number of end vertices in G.

Proof:

Let E = {e1, e2,...,ek} be the edge set in G. Now consider

E1 {e1 , e2 ,..., em}  E(G) be the set of edges with maximum edge degree and

E2 {e1 , e2 ,..., en }  E(G) be the set of edges with minimum edge degree. Suppose E '1  E1

E ' 2  E2
and then {E '1  E '2 } forms a minimal edge dominating set of G. Further if induced

subgraph E(G) {E '1  E '2 } is regular then {E '1 E '2} it is a co-regular edge dominating set

of G. On the other hand let A = {v1, v2,…, vn} be the set all end vertices in G. Let K = {v1, v2,…,

vp}  V (G) be the maximum set of vertices such that deg(vi , v j )  2, and

N (vi )  N (vj )  x,  vi , v j  K so that x V (G)  K. Clearly K  0 (G). It follows that

{E1 ' E2 '}  A  K which gives,  'cr (G)  m  0 (G).

22
Theorem 3.3

For any connected (p, q) graph G with p  4 vertices,

 'cr (G)   crt (G)   s (G)   c (G) with, G  K p , G  P4 .

Proof:

Let E1 {e1 , e2 ,..., ek }  E(G) be the minimal set of edges which covers all the edges in

G such that N[E1}=E(G). Then E1 is the edge dominating set of G. If the induced subgraph

E(G)  E1 is regular then E1 is a co-regular edge dominating set of G. Suppose

A{v1 , v2 ,..., vm }  V (G) such that deg(vj )  2, 1  j  m. Then there exists at least one

vertex v of maximum degree of G in A. Let D be a minimal dominating set of G such that

D  A if the subgraph D has exactly one component then D itself is a connected dominating

set of G. On the other hand if the induced subgraph V (G)  D  F is disconnected then {F} is

a split dominating set of G. Further V (G)  D  B,vi  B , if D {vi } has no isolates.

Then D {vi } forms a minimal total dominating set of G. Also if V (G)  D {vi } and

vi  B1 has same degree the {B1} is a  crt  set of G. it follows that E1  B  F  D,

which gives  'cr (G)   crt (G)   s (G)   c (G).

23
Theorem 3.4

For any connected (p, q) graph G with p  3 Vertices,

 'cr (G)   crr (G)   (G)  2 and G  K1, p , G  Pp .(p  6).

Proof:

For the graph G = Pp with p  6 for p = 4,  'cr (G)  1  crr (G)   (G)  2  2. for p=5,

6,  'cr (G)  2  (G)   (G)  2 3, 4 and hence the result not holds for path p  6 . Let

A {v1 , v2 ,..., vp }  V (G) be set of vertices with deg(vi )  1, such that N(A] = V(G). Clearly A

forms a dominating set of G. Suppose B {v1, v2 ,..., vk }  V (G) be the set of end vertices in G

and A’ = V(G) – B. Then there exists a vertex set H  A' such that vi {V(G)  H  B} is

adjacent to at least one vertex of {H  B} and in V(G)  H  B . Then {H  B} is a  r set of

G. If V(G)  H  B is regular then {H  B} itself is a  crr set of G. let {e1, e2,…, ep} = E(G)

be the edge set in G. Suppose S be the minimal edge dominating set of G. If E(G) S has

same degree then S itself is a  'cr set of G. Hence S  {H B}  A  2 which gives,

 'cr (G)   crr (G)   (G)  2.

24
Theorem 3.5

For any connected (p,q) graph G with p  4 vertices,

 'cr (G)  0 (G)   crs (G)  2 with, G  K p , G  P4 .

Proof:

Suppose G = Kp. Then by the definition

 s set does not exists, hence  crs also does not

exists. Let D={v1, v2,…,vp} be the minimal set of vertices in G, such that V (G)  D is regular

and which gives more than one component. Then D forms a minimal co-regular split dominating

set of G. Suppose B {v1 , v2 ,..., vn }  V (G) ei E(G) is incident to at least one vertex B.

Then B 0 (G). Further E(G) = {e1, e2,…,en} be the edge set of G. Let

A{e1 , e2 ,..., ek }  E(G), Which covers all the edges in G. Such that N[A]=E(G),

then A is a minimal edge dominating set of G. If the induced subgraph E(G)  A has same

degree then A is a
 'cr set of G. It follows that A  B  D  2. Which gives

 'cr (G)  0 (G)  crs (G)  2.

Corollary 3.6

 'cr (G)   '(G).

For any connected (p, q) graph G

25
Theorem 3.7

For any connected (p, q) graph with p  3 vertices,

2 'cr (G)   '(G)   s (G) and G  K p , G  P4

Proof:

Suppose G = Kp by the definition,  's  set does not exists. Also if G = P4, then

2 'cr (G)   '(G)   s (G), a contradiction to P . Let A {v1 , v2 ,..., vp }  V (G) be the set of all
4

end vertices in G and A’ = V(G) – A. Suppose there exists a vertex set B  A ', such that D =

[V(G) – B] is a dominating set of G. Hence D has more than one component then D forms a

 's  set of G. Further let E = {e , e ,…,e } be the edge set of edge set in G. Now consider
1 2 p

E1 {e1 , e2 ,..., em }  E(G)

be the set of edges with minimum edge degree and

E2 {e1 , e2 ,..., en }  E(G) E '1  E1

be the set of edges with minimum edges degree. Suppose

and E '2  E2 if every edge in E '1  E '2  is adjacent to an edge in V (G)  E '1  E '2  then

E '1  E '2  for a

 ' set
of G. Suppose V (G)  E '1  E '2  S is regular. Clearly {S} is a

 'cr  set of G. Thus 2 S  E '1  E '2  D which gives, 2 'cr (G)   '(G)   s (G) .

26
Theorem 3.8

For any connected (p, q) graph with p  3 vertices,

2 'cr (G)  1 (G)   '(G)   g  1 with G  Pp (P  4).

Proof:

Let E = {e1, e2,…,ek} be the edge set of G . Suppose E '  E then N[E’] = E(G) then E’

is an edge dominating set of G. If E(G) {E '} is a regular, then {E’} itself is a  'cr set of G.

Let e be an edge with degree  ' and let D  {v1 , v2 ,..., vn }  V(G) and D  V (G). If

N[D]  V (G). and N[D]  V (G). Then D is dominating set of G and G. Let A = {e1, e2,…,em}

be the set of all end edges in G. Then A  F where F  E(G)  A be the minimal set of edges

which covers all the vertices of G such that A  F 1 (G). Thus 2 {E'}  A  F  e  D 1

which gives, 2 'cr (G)  1(G)   '(G)   g  1.

Theorem 3.9

For any connected (p, q) graph with p  3 vertices

 'cr (G)  diam(G)   (G)   R (G)  t (G).

Proof:

Let B  V (G) be the minimal set of vertices. Further, there exist an edge set J  J '

where J’ is the set of edges which are incident with the vertices of B constituting the longest path

27
in G such that J  diam(G). Let D  {v1, v2 ,..., vn }  B be the minimal set of vertices which

covers all the vertices in G. Clearly D forms a dominating set of G. Suppose the subgraph D

has no isolates. Then D itself is a  t (G) set. Otherwise if deg(vk )  1 then attach the vertices

wi  N (vk ) to make deg(vk )  1 such that D {wi } does not contain any isolated vertex.

Clearly D {wi } forms a total dominating set of G. Further Let function f : V (G)  {0,1, 2} and

partition the vertex set V(G) into (V0, V1, V2) induced by f with Vi  ni for i=0, 1, 2. Suppose

the set V2 dominates V0. Then S  V1 V2 forms a minimal Roman dominating set of G. Further

let A  {e1, e2 ,..., ep }  E(G) be the minimal set of edges which covers all the edges in G. Clearly

A forms a minimal edge dominating set of G. If E(G)  A is regular then A is a co-regular

edge dominating set of G. Then A  J  D  S  D {wi } which gives,

 'cr (G)  diam(G)   (G)   R (G)   t (G).

In the following theorem we establish the relationship between  dd (G),  r (G) with

co-regular edge domination of a graph G.

Theorem 3.10

For any connected (p, q) graph G with p  3 vertices,

 p
 'cr (G)   dd (G)    (G) 1.
 2  t

Proof:

28
 Let S = {e1,e2,...,em} be an edge dominating set of G. Let D} = (v1,v2,…,vk} which is

dominating set of G. Suppose V1  V (G)  D1 be the set of vertices which are neighbors of the

elements of D1. Further D  V and D  N  D . Then Dd  D  D forms double

2 2 2 1 1 2

dominating set of G such that any vertex v V (G)  Dd has at least two neighbors in D  D .
1 2

Further let A  {e1, e2 ,..., ep }  E(G) be the minimal set of edges which covers all the edges in G.

Such that N[E1] = E(G). Then E1 is an edge dominating set of G. If E(G)  E is regular then
1

{E1} itself is a  'cr set of G. Let B  {v1 , v2 ,..., vp }  V (G) be the set of end vertices in G and

B’ = V(G) – B. Then there exists vertex set H  B ' such that vi {V(G) {H B} is adjacent

to at least one vertex of H  B and in V (G) {H  B}. Then H  B is a  r set of G. Also

 p
by theorem A,  '(G)  . Thus E1  Dd 
V (G)
 H  B 1 which gives,
 2  2

 p
 'cr (G)   dd (G)    (G) 1.
 2  t

Theorem 3.11

For any connected (p,q) graph G with p  3 vertices,

 'cr (G)   'e (G) 1  2(p1).

Proof:

Suppose D be a minimal edge dominating set of G and E(G) – D be the set of all edges

which are adjacent to the edges in D. Then D’ =[E(G) - D] has same degree then {D’} is a co-

regular edge dominating set of G. Now let E1 = {e1, e2,…, ej} denote the set of all end edges in

29
G and E2=E(G)-E1. Further if F  E2 is edge dominating set of subgraph E2 then E1  F

forms and end edge dominating set of G. Clearly it follows that D '  E1  F 1  2(p1) and

hence  'cr (G)   'e (G) 1  2(p1).

An edge dominating set X is is called a connected edge dominating set if the edge

induced subgraph X is connected. The minimum cardinality of a connected edge dominating

set of G is called the connected edge dominating set of G is called the connected edge

domination number of G and is denoted by  'c (G). For details see[3].

Theorem 3.12

For any connected graph G with p  4 vertices,

 'cr (G)   'e (G)  1(G)   s (G) and G  K p , G  Pp ( p  5).

Proof:

For thr graph G=Pp with p  5 if p = 3, 4, 5 then  'cr (G)   'c (G) 2,3, 4 not greater than

1 (G)   s (G) 3, 4,5. Hence G  Pp with p  5. Suppose D = {e1, e2, …, en} be the set of all

end edges in G. Then D  J Where J  E G  D be the minimal set of edges which covers all

the vertices of G such that D  J  1 G. Let D1 = {e1, e2,…, ej} be the set of non-end edges

which covers all the edges in G. If the induced subgraph E G   D1 is regular then {D1} is a

coregular edge dominating set of G. Now consider S = {e1, e2,…,ei} be the minimal edge

dominating set then S does not contain more than one component. Then S itself is a connected

edge dominating set of G. Otherwise if the subgraph S has more than one component then

30
attach the minimum number of edges ek   E(G)  S with deg(ek )  2 such that S1  S ek 

forms exactly one component clearly S1 forms a  'c set of G. On the other hand let F = {v1, v2,

…, vn} be the minimal dominating set G if the V G   F is disconnected then clearly F forms

a split dominating set of G. D1  S1  D  J  F which gives,

 'cr (G)   'e (G)  1 (G)   s (G).

Theorem 3.13

For any connected (p,q) graph G with p  3 vertices,

 'cr (G)   (G) 1  p   'c (G).

Proof:

Let D be a dominating set of G and let E {e1, e2 ,..., en }  E(G) be the set of all non-end

edges in G. Suppose there exist a minimal set of edges such that N[ei ]  E(G),ei  E1 , 1  i  n

then E1 forms a minimal edge dominating set of G. Further if subgraph E1 has exactly one

component, then E1 itself is a connected edge dominating set of G. Further E2  E1 such that the

induced subgraph E(G)  E2 is regular clearly E2 is a co-regular edge dominating set of G.

Hence E2  D 1  V (G)  E1 which gives,  'cr (G)   (G) 1  p   'c (G).

31
Theorem 3.14

For any connected (p,q) graph G with p  3 vertices,

diam(G)  1
 'cr (G)   1
 2 


Proof:

Let E  {e1 , e2 ,..., en }  E(G) be the set of edges which constitute the longest path

between teo distinct vertices u, v V (G) such that d(u,v) = diam(G). Now E1  E(G),ei E1

since E1 be the minimal set of edges which covers all the edges in G then E1 is a minimal edge

domination set ogf G. Further if deg(ej )  1, ej  E(G)  E1 then E(G)  E1 is regular then

 diam(G)  1
{E1} is a coregular edge dominating set. It follows that E  1. Hence
1
 2 

diam(G)  1
 'cr (G)   1.
 2 

32
 4 THE EDGE DOMINATION NUMBER OF

CONNECTED GRAPHS

A subset X of edges in a graph G is called an edge dominating set of G if every edge not

in X is adjacent to some edge in X. The edge domination number  (G) of G is the minimum

cardinality taken over all edge dominating sets in g. Let m, n and k be positive integers with

n 
n 1  m   , g(m, n) be the set of all non-isomorphic connected graphs of order n and size
 2 

m, and g(m, n; k) {G  g(m, n}:  (G)  k}. We are able to determine all integers m, n, k for

which g(m, n; k)  .

The main results on  ' in g(m,n)

A set S of vertices G is a dominating set of G if vertex in V(G)-S is adjacent to some

vertex in S. A minimum dominating set in a graph G is dominating set of minimum cardinality.

The cardinality of a minimum dominating set is called the domination number of G and is

denoted by  (G). There is an analogous concept of the edge domination which was introduced

by Hedetniemi and Mitchell [3]. A subset X of edges in a graph G is called an edge dominating

set of G if every edge not in X is adjacent to some edge in X. The edge domination number

 '(G) of G is the minimum cardinality taken over all edge dominating set of G.

n
Let G be connected graph of order n. We can easily conclude that  (G)  by the fact
2

that if S is a dominating set of G, then V(G)-S is also a dominating set of G. In order to prove

33
 n
that  '(G)  for any connected graph G of order n. We first observe the following facts. Let G
2

be connected graph of order n and X be a minimum edge dominating set of G.

1. X contains no cycle, otherwise, let C : e1, e2,…,et, et+1 = e1 be a cycle

induced by t edges of X. Then for each i=1,2,…,t, X-(ei} and edge dominating

set of G.

2. X contains non path of order 4, otherwise, let P :e1, e2, e3 be a path of order

4 induced by 3 edges e1, e2, e3 in X. Thus X-{e2} is and edge dominating set

of G.

3. Suppose that there exist ei= uv, ej = vw X. Thus there exist in edge f of G

such that f is incident to u, otherwise X-{ei} is an edge dominating set of G.

Further, f X and X '  X {ei }  f  is a new minimum edge dominating

set of G with ei and f are not adjacent in X’.

We have the following results.

Theorem 4.1

Let G be a connected graph of order n. Then

 '(G)  min X : X is a maximal independent edge set of G.

n
In particular  '(G)  .
 2 
 


A characterization of graphs reaching the upper bound was obtained in[1] and can be

stated as the following theorem.

34
Theorem 4.2

n
For any connected graph G of even order n,  '(G)  if and only if G is isomorphic to
2

Kn or Kn/2, n/2.

Using the notation min( '; m, n) : min{ '(G): G  G(m, n)} and

min( '; m, n) : min{ '(G): G  G(m, n)} , we can rephrase Theorem 4.2 as follows.

Corollary 4.3

n  n2  n 
min( '; m, n)  2 if and only if n is even and m ,  .
4 2 
 

It is easy to see that any connected graph G of order n = 2, 3,  '(G) 1. We assume from

now on that n  4.

Let G be a connected graph of order n and  '(G)  t. Thus there exists X  E(G) such

 2t 
that X is a maximal independent edge set of size t. Therefore E(G)  2t(n  2t)   . Put
 2 

 2t 
 (t) : 2t(n  2t)   if t  1 and (0) = n-2. Then we obtain the following result.
 2 

Theorem 4.4

Let n and t be the integers with  '(G)  t. Then  '(G)  t. if and only if  '(G)  t.

Let G be graph of order n. Then G is called a split graph if V(G) can be partitioned into

two sets X and Y such that  '(G)  t. is a complete graph  '(G)  t. is an empty graph . A split

35
graph G with the partitioning X and Y is said to complete for each pair of vertices  '(G)  t. and

 '(G)  t. , x and y are adjacent in G. We use CS(k, n-k) for the complete split graph with the

portioning sets X and Y with  '(G)  t. and  '(G)  t. Thus CS(2t,n-2t) is the unique split graph

of order n with  '(G)  t. and the maximum number of edges.

n
Let m, n and k be positive integers with n 1  m   , g(m, n) be the set of all non-
 2 

isomorphic connected graphs of order n and size m, and

g(m, n; k) {G  g(m, n) :  '(G) k}.

Let G be graph of order n and size m. If  '(G)  t. then , by Theorem 4.4, m  (t) Since

we deal with connected graphs, It follows that n 1  m and hence n 1  m  (t). This shows

that if g(m, n;t)  , then n 1  m  (t). The rest of this chapter devoted to proving by

construction that if n 1  m  (t), then g(m, n;t)  . starting with graph CS(2t, n-2t) we will

give an algorithm to show how edges can be removed from that graph in such a way that the

resulting graph on each step has the edge domination number and changed. The following two

lemmas are simple but useful.

36
Lemma 4.5

Let G be graph of order n containing K2t as its subgraph. Then  '(G)  t.

Proof:

Let G be a graph of order n containing K2t as its subgraph and X be a minimum edge dominating

set which is also independent. Then for each pair of distinct vertices x, y of K2t there exists at

least one e  X such that x and e are incident. This proves that  '(G)  X  t.

As a consequence of Lemma 4.5 we have the following result.

Lemma 4.6

Let CS(2t, n-2t) be the complete split graph with X  Y as its vertex set, X  2t and

Y  n  2t Put U xy ; x  X , y Y. Then for each F  U ,  '(CS(2 t, n 2 t)  F)  t .

 2t 
As a consequence of Lemma 4.6 we have that if n  2t    m  (t), then
 2 

g(m, n; t)  .

In order to proceed further we first list some more notation and observations with the

following facts.

1. Let G and H be two vertex-disjoint graphs. We use G  H to denote a graph with

V (G  H ) V (G) V (H ) {x}and

E(G  H )  E(G)  E(H ) {xv : v  V(G)  V(H)}. With this notation it follows that

37
  '(G  H )   '(G)   '(H)  1. In particular  '(Kp  Kq )   '(Kp )   '(Kq ) if both p and

q are odd and  '(Kp  Kq )   '(Kp )   '(Kq )  1 otherwise, where  '(K1 )  0.

2. Let G1, G2,…,Gt be pairwise vertex disjoint graphs with t  3. We use

G  G  G to denote a graph with V(G  G  G )  x  t
V (G ). and
1 2 t 1 2 t i1 i

E(G  G  G )  {xv : v 

1 2 t

3. Let X be a finite nonempty set. We use K(X) to denote the complete graph with X as

its vertex set.

4. Let G be a connected graph with  (G)  2. If X is a minimum edge dominating set of

G which is also independent and e  uv  X , then  '(G {u, v})   '(G) 1.

5. Let G be a graph of order n containing K2t as its subgraph and X be a minimum edge

dominating set which is also independent. Then for each pair of distinct vertices x, y

of K2t there exists at least one e  X such that x and e are incident or y and e are

incident. This proves that  '(G)  X  t.

Lemma 4.7

Let P = {u1, v1} Q = {u2, v2, u3, v3,…,ut, vt} and U = {u1ui, u1vi, v1ui, v1vi : I = 2, 3,…,t}.

If G  K (P)  K (Q), , where V (G)  P  Q {x}, and F  U , then  (G  F )  t.

Proof:

By observation 1 above, we have that  (G)  t. By choosing D = {xu1, u2v2, v3,…, utvt}

as an edge dominating set of G, it follows that for any F  U , D D is an edge dominating set of

G+F and hence  (G  F )  t.

38
 Suppose that there exists F  U such that  (G  F )  t 1. Thus any minimum edge

dominating set of G+F must contain an edge in F. Let D1 be a minimum edge dominating set of

G+F of cardinality t-1. Without loss of generality. We may assume that u1 ,u2  E1. Thus G+F –

{u1, u2} = t-2 but G+F – {u1, u2} contains K2(t-1) as its subgraph. This contradicts Lemma 4.6.

Note that graphs as described in Lemma 4.7 have order 2t+1. And by adding n-2t-1

vertices and joining each vertex to x, the resulting graphs have order n and  '  t. Therefore as a

consequence of Lemma 4.7 we have that if

 2t 1  2t  1
n  2t  2   m  n  2t 1  , then g(m, n; t)  .
 2   2 
   


The graph G1  G  K (P)  K (Q)  K2  K2(t 1) with P, Q and V(G) as in Lemma 4.7

satisfies  '(G)  t if t  3, we can define G2  K2  K2  K2(t2) . Clearly  '(G)  t and by the

same argument as in the proof of Lemma 4.7 we have that if

 2t  3  2t 1 
n  2t  5   m  n  2t  2  , then g(m, n;t)  . By continuing in this way can
 2   2 
   

define Gt  K {u1 , v1}  K {u2 , v2 }  K {ut , vt }. Since Gt has order 2t+1 and size 3t, it

follows by adding n-2t-1 vertices to Gt and joining each vertex to x result a graph of order n,

size n+t-1 and Put Gt* be the resulting graph. Let D= {xui: I = 1, 2, …,t}. Then for any

F  D,  (G*t  F )  t. Thus we can conclude the following theorem.

39
Theorem 4.8

n
Let m, n, t be integers satisfying 1  t  . Then g(m, n; t)   if and only if
2

n 1  m  (t).

40
 5 THE CO-EDGE INDEPENDENT

DOMINATION NUMBER OF A GRAPH

An edge dominating set X of a graph G = (V, E) is a co-edge independent dominating set

(ceid-set) if no two edges in the edge induced subgraph E\X are adjacent. The minimum

cardinality of a ceid-set of G is called the co-edge inde4pendent domination number and is

denoted  'cei (G) . In this chapter, many bounds on  'cei (G) are obtained and its exact values for

some standard graphs are found. Also, its relationship with other parameters is investigated.

Some Results:

Theorem 5.1 [7]

For any graph G with order p, 0  0  p  1  1 , where 0 ,1 are the covering and

edge covering number of G and 0 , 1 are the independence and edge independence number of

G.

Theorem 5.2 [7]

Konig-Edervarg Theorem: In a bipartite graph, the number of edges in a maximum

matching is equal to the number of vertices in a minimum covering. ( 1  0 )

Theorem 5.3 [7]

In a bipartite graph with   0, the number of vertices in a maximum independent set is

equal to the number of edges in a minimum edge covering. ( 1  0 )

41
Theorem 5.4 [2]

For any graph G,  '(G) =  'i (G).

Theorem 5.5 [2]

For any connected graph G,  '(S(G))  p1.

Theorem2.6 [12]

For any graph G,  '(G)  q  1  q0 where q0 is the number of isolated edges in G.

Main Results

All the graphs we consider here are connected.

Definition 5.1

An ed-set of a graph G = (V, E) is a co-edge independent dominating set (ceid-set) if no

two edges in the edge induced subgraph E\X are adjacent. The minimum cardinality of a

ceid-set of G is called the co-edge independent domination number and is denoted  'cei (G).

A ceid-set with minimum cardinality is referred as  'cei  set.

42
Example 5.2

For the graph G, X = {e1, e4, e5, e6, e7, e10} is a minimum ceid-set and hence  'cei (G)  6.

Theorem 5.7

For any connected graph G,  '(G)   'ces (G)   'cei .

Proof:

Since every c0-edge split domination set of a graph G is an edge domination set of G and

hence  '(G)   'ces (G). Similarly, every co-edge independent domination set of G is a co-edge

split domination set of G and hence  'ces (G)   'cei . The result follows from two inequalities.

Theorem 5.8

For any cycle graph Cp of order p  3,

(i)  'cei (CP )   p / 2


(ii)  'cei (S(CP ))  p

Proof:

Case(i) : Let G = Cp.

43
 Let V(Cp) = { v1, v2, v3, …, vp} be the vertices set of Cp Such that E(Cp) = { ei / ei = vi

vi+1, i = 1, 2, 3,…,p-1, ep = vpv1}. Let S be any independent set of p/2 edges of Cp if p is even and

(p-1)/2 edges of Cp if p is odd. Clearly, S   p / 2 for both the case p is odd or even. Then the

remaining edge in E\S forms the  'cei  set of CP.

Hence  'cei (CP )  E \ S  q   p / 2  p   p / 2   p / 2.

Case(ii) : Let S(Cp).

Let V(S(Cp)) = {v1, w1, v2, w2, v3, w3,…,vp, wp} be the vertices set of S(Cp) such that

E(S(Cp) = {ei / e2i-1 = viwi, e2i = wivi+1, I = 1, 2,…,p}. Then both the order and size of

S(Cp) = 2p. In which, the alternate q/2 edges are independent and hence the remaining q/2 edges

of E(S(Cp)) forms the  'cei  set of G. Hence  'cei (S(Cp )) q/ 2  p.

Theorem 5.9

For the complete graph Kp of order p  3,

(i)  'cei (K p ) q p/ 2 and

(ii)  'cei (S(K p ))  2q  p p2  2p.

Proof:

Case (i): Let G = Kp.

Let V(Kp) = {v1, v2, v3,…,vp} be the vertices set of KP and E(Kp) = {e1,

e2,…,ep,ep+1,…,en} where n = pC2. Assign the first p edges in following manner {ei / ei = vivi+1,

i= 1, 2,…,p-1 and ep = vpv1}. Then the maximal independent edge set with cardinality p / 2 in

44
the cycle v1, e1, v2, e2, v3, e3,…,vp, ep, vp is maximal independent edge set of G and the remaining

edges is the maximum ceid-set X of G. Hence  'cei (K p )  X  q  E \ X  q   p / 2.

Case (ii): Let G = S(Kp).

Let V(S(Kp)) = { v1, v2, v3,…,vm } where m = p + pC2 be the vertices set of S(Kp) and

E(S(Kp)) = { e1, e2,…,ep, ep-1,…,e2p,e2p+1,…,eq } where q = 2pC2. Assign the first 2p edges in

following manner { ei / ei = vi vi+1, i = 1, 2,…,2p-1 and e2p = v2p, v1 }. Then the maximal

independent edge set with cardinality p in the cycle v1, e1, v2, e2, v3, e3,…,vp, ep, vp is a maximal

independent edge set of G and the remaining edges is the minimum ceid-set X of G.

Hence  'cei (S(Kp ))  X  q  E \ X  q  p  2 pC2  p  p2  p.

Theorem 5.10

For the complete graph Pp of order p  3,

(iii)  'cei (Pp )  (p1) / 2 and

(iv)  'cei (S (Pp ))  p 1.

Case (i): Let G = Kp.

Let V(Pp) = {v1, v2, v3,…,vp} be the vertices set of CP and E(Pp) = {ei /ei = vi,vi+1, i = 1, 2,

,…,p-1}. Let S be any independent set of (p/2) – 1 edges of Pp if p is even and (p-1)/2 edges of G

if p is odd. Clearly, S  p 1 / 2 for both the case p is odd or even. Then the remaining edge

in E\S forms the  'cei  set of G. Hence

 'cei (Pp )  E \ S  q  ( p 1) / 2 ( p 1)   p 1 / 2   p 1 / 2.

45
 Case (ii): Let G = S(Pp).

Let V(S(Pp)) = { v1, w1, v2, w2, v3, w3 ,…,vp, wp } be the vertices set of S(Pp) such that

E(S(Pp)) = { ei / , e2i-1 = viwi, e2i = wivi+1, i = 1, 2,…p-1 }. Then the size of S(Cp) is q=2p-2. In

which, the alternate q/2 edges are independent and hence the remaining q/2 edges of E(S(Cp))

forms the  'cei  set of G. Hence  'cei (S(Pp ))  q / 2  p 1.

Theorem 5.11

For the subdivision of star graph G = SK1,n ,n  1

 '(G)  'i (G)  'ces (G)  'cei (G)  q  1.

Proof:

The subdivision of star graph has G has 1 edge independent set. Then the remaining

edges in G forms the minimum ed-set, ide-set, cesd-set and ceid-set and hence the results.

 'cei for some standard graphs and its subdivision

Now, we list the exact values of

graphs.

Proposition 5.12

(i) For the wheel graph Wn, n  3

 'cei (Wn )  2n  n / 2 ,  'cei (S(Wn )) 3n 1

(ii) For the book graph Bn, n  1

 'cei (Bn )  2n,  'cei (S(Bn ))  4n

46
 (iii) For the fan graph Fn, n  2

 'cei (Fn )  2n 1 n / 2 ,  'cei (S(Fn )) 3n 1

(iv) For the complete bipartite graph Km,n m  2, n  2

 'cei (Km,n )  m(n 1),  'cei (S(Km,n ))  2mn (m  n)

(v) For the triangular snake graph mC3, m  1[8]

 'cei (mC3 )  2m,  'cei (S(mC3 ))  4m 1

Theorem 5.13

For any graph G,  '(G)  q  1   'cei (G).

Proof:

 'cei  set
Let X be a of G. Since the edge set E\X has independent edges gives the edge

E \ X  1 gives q  'cei (G)  1      (1).

set E\X has at most 1 edges. Hence

Since G is connected, G has no isolated edges and hence by Theorem 5.6 we get,

q  1   '(G)      (2).

Then the results follow from equations (1) and (2).

47
Corollary 5.14

For any graph G, q  p   'cei (G) 1.

Proof:

The result follows from the Theorem 5.1 and Theorem 5.13

Corollary 5.15

For any bipartite graph G, q  0   'cei (G).

Proof:

The result follows from the Theorem 5.2 and Theorem 5.13

Corollary 5.16

For any bipartite graph G with   0, q  0  p   'cei (G) where δ is minimum

vertex degree of G

Proof:

The result follows from the Theorem 5.3 and Theorem 5.13.

48
Theorem 5.17

For any (p, q) graph G,  'cei (G) (2q  p 1) / 2.

Proof:

Let X be a  'cei  set of G. Then the independent edge set E\X has at least p/2 edges if p

is even and (p-1)/2 edges if p is odd. Hence E \ X  ( p 1) / 2. That is q   'cei (G)  ( p 1) / 2

gives the result.

Theorem 5.18

For any tree T with order p,  'cei (T) ( p 1) / 2.

Proof:

Let X be a  'cei  set of G. Since the size of T is p-1, the result follows from Theorem

4.17.

Lemma 5.19 [2]

For any tree T of order p, 1 (S(T ))  p 1.

49
Theorem 5.20

For any tree T of order p,  'cei (S(T ))  p 1.

Proof:

Let X be a  'cei  set of S(T). By using theorem 5.13 and lemma 5.19, we have

2( p 1)  (p1)   'cei (S(T )) and hence the result. The equality is holds for subdivision of star

graph S(K1,n) for n  1.

50
REFERENCES

[1] Araya chaemchen, The edge domination number of connected graphs, Australian

Journal of Combinatorics, Vol 48, 185-189.

[2] S. Arumugam and S. Velammal, Edge domination in graphs, Taiwanese J. Math. 2(2),

(1998), 173-179.

[3] S.Arumugam and S. Jerry, “Fractional Edge domination in graph” Appl. Anal.

Discrete Math., Vol. 3, pp. 359-370, 2009. Doi: 10.2298/AADM092359A.

[4] S. Arumugam and S. Velammal, 2009. Connected edge domination graphs, Allahabad

Mathematical Society, Vol 24, part, 43-49.

[5] C. Berge, 1962. Theory of graphs and its applications, Methuen, London,.

[6] D. B. West, Introduction to Graph Theory, Prentice Hall of India, New Delhi, 2003.

[7] E. J. Cockayne, R. M. Dawes and S.T. Hedatniemi, 1980. Total domination in graphs,

Networks, 10, 211-219.

[8] Harary, F., “Graph Theory”, Addition Wesley, Reading mass, 1699.

[9] F. Harary and T. W. Haynes, 2000. Double domination in graphs Ars Combin Vol 55,

201-213.

[10] G. S. Domke, J. H. Hattingh, S. T. Hedatniemi, R. C. Lasker and L.R. Markus, 1997.

Restrained domination in graphs, Discrete math., 203, 61-69.

51
 [11] G.Chartrand and P. Zhang, Introduction to Graph Theory, International Edition,

Mcgraw-Hill, 2005.

[12] Joseph A.Gallian, “A Dynamic Survey of Graph Labeling” The Electronic Journal of

Combinatorics 15, #D16, 2008.

[13] Kulli, V. R. and Sigarkanti, S.C., “The connected egde domination number a graph”

Proc.R.C.Bose Mem Conf. Abstract, 1988.

[14] Kulli, V.R. and Janakiram,B., “The split domination number of graph”, Graph

Theory Notes of New York XXXII, New York Academy of Science, pp.16-19, 1997.

[15] Kulli, V.R. and Janakiram,B., “The non-split domination number of graph”, Indian J.

pure and appl. Math., 31(4), pp.441-447, 2000.

[16] V. R. Kulli, 2010. Theory of domination graph, Vishwa International publications,

India.

[17] V. R. Kulli and N. D. Soner, “Complementary edge domination in graphs”, Indian

Journal Pure and Appl. Math., Vol. 28, no. 7, pp. 917-920, 1997.

[18] Mitchell .S and S.T. Hedatniemi, Edge domination in trees, Congr. Numer., pp. 489-

509, (1977).

[19] M.H. Muddebihal and Priyanka. H. Mandarvarkar, 2019. Co-regular split

domination in graphs. JES, Vol-10, 259-264.

[20] M.H. Muddebihal and Priyanka. H. Mandarvarkar, 2020. Co-regular restrained

domination in graphs. CEJ, Vol-11, 236-241.

52
 [21] M.H. Muddebihal and Priyanka. H. Mandarvarkar, 2019. Co-regular total

domination in graphs. International Journal of Applied Information Systems (IJAIS), Vol-12, 16-

19.

[22] M. Yannakakis and F. Gavril, “Edge dominating sets in graphs”. SIAM J. Appl.

Math., Vol. 38, pp. 364-372, 1980.

[23] M.H. Muddebihal and A.R. Sedamkar, Characterization of trees with edge

domination and end edge domination numbers”, International Journal of Mathematics and

Computer Applications Research, Vol. 3, no. 1, pp. 33-42, 2013.

[24] O.Ore, 1962. Theory of graphs, Amar. Math.Soc.Colloq. Publ. 38. Providence, RI.

[25] S. T. Hedetniemi and R. C. Lasker, “Bibliography on domination in graphs and

some basic definitions of domination parameters”, Discrete Math., Vol. 86. pp. 257-277, 1990.

[26] S. R. Jayaram, “Line domination in graphs”, Graphs Combin., Vol. 3, pp. 489-509,

1977.

[27] S. K. Vaidya and R.M Pandit, “Some results on global dominating sets”,

Proyeccions Journal of Mathematics, Vol. 32, no. 3, pp. 235-244, 2013.

[28] S. K. Vaidya and R.M Pandit, “Some new perspectives on global domination in

graphs”, ISRN Combinatorics, Vol. 2, Article ID 201654, 4 pages, 2013. Doi:

1155/2013/201654.

[29] T.W. Haynes, S. T. Hedatniemi and P. J. Slater, 1997. Domination in graphs:

Advanced Topics, marcel Dekker, Inc., New York.

53
 [30] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, “Fundamentals of Domination

Graphs”, Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, New

York, 1998.

[31] R. Dutton and W. klostermeyer, “Edge dominating sets and vertex covers”,

Discussions Mathematicae, Graph Theory, Vol. 33, pp. 437-456, 2013. Doi: 10.7151/dmgt.1681.

[32] Zelinka, B. “Edge domination in graphs of cubes”, Czechoslovak Math Ematical

Journal, Vol. 52, no. 4, pp. 875-879, 2002.

54