Scribd
Upload
24 views

New

Uploaded by

srinipriya5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

New

Uploaded by

srinipriya5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

UPPER MAJORITY DOMINATION NUMBER OF GRAPH

Definition:3.4

A function g : V → {−1, 1} is called a majority dominating function if g(N [v]) ≥ 1


for at least half of the vertices v ∈ V . The majority domination number of graph G is
γmaj (G) = {g(V): g is a majority dominating function of G}

Definition:3.5

A majority dominating function g of G is called a minimal majority dominating func-


tion, if there does not exist a majority dominating function h : V → {−1, 1} such that
h 6= g and h(v) ≤ g(v) for every v ∈ V .

Theorem: 3.11

A Majority dominating function g of a graph G is minimal if and only if |S|−k < d n2 e.

Proof:

Suppose |S| − k < d n2 e .

Let f : V → {−1, 1} be a function such that f < g.


Hence there exists v ∈ V such that g(v) = 1 and f (v) = −1.
Let S1 = {u ∈ V : f (N [u]) ≥ 1}.

Then |S1 | ≤ |S| − k < d n2 e.


Hence f is not a majority domainating function of G.
Thus g is a minimal majority dominating function of G.

Conversely,

44
Let g be a minimal majority dominating function of G and let g(v) = 1.

Define h : V → {−1, 1} by h(v) = −1 and h(w) = g(w), for all w 6= v.

Let S2 = {v ∈ V : h(N [v]) ≥ 1}


Now for any w ∈ N [v] with g(N [w])=2or 1,
we have f (n[w]) = 0or -1
Hence |S2 | = |S| − k < d n2 e.

Theorem: 3.12

For any integer n ≥ 2,

1 if n is odd

Γmaj (Kn )=
2 if n is even

Proof:

Let V (Kn ) = {v1 , v2 , v3 , ..., vn }.


Any function g : V → {−1, 1}, is a majority dominating function of Kn if and only if
|P | ≥ d n+1
2
e.

Further if |P | > d n+1


2
e, then g(N [vi ]) ≥ 3 for all vi ∈ V .

Hence k(vi ) = 0 for all vi ∈ V , so that k= 0.


Also |S| = n and hence |S| − kd n2 e.

Thus it follows from


A Majority dominating function g of a graph G is minimal if and only if |S| − k < d n2 e.
g is not a minimal majority dominating function of Kn .
Hence, g is minimal majority dominating function of Kn if and only if |P | = d n+1
2
e.

45
1 if n is odd

Therefore for any minimal dominating function of Kn , g(V )=
2 if n is even

1 if n is odd

Hence Γmaj (Kn )=
2 if n is even

Theorem: 3.13

For any integer n ≥ 2,

1 if n is odd

Γmaj (K1 , n − 1)=
2 if n is even

Proof:

Let G = K1,n−1 .
Let V (G) = {v1 , v2 , v3 , ..., vn−1 } and d(v) = n
Let g : V → {−1, 1} be a majority domainating function of G.
If g(v) = −1, then g(N [vi ]) ≤ 0 for all i, 1 ≤ i ≤ n − 1,

which is contradiction.
Hence g(v) = 1.
Now, g(N [vi ]) ≥ 1 if and only if g(vi ) = 1 for atleast d n−1
2
e vertices vi .
Thus v ∈ P and |P | ≥ d n−1
2
e + 1.

Also if |P | ≥ d n−1
2
e + 1, then g(N [v]) ≥ 2 for all v ∈ P .
Hence |S| − k > d n2 e and by theorem
A Majority dominating function g of a graph G is minimal if and only if |S| − k < d n2 e.
g is not a minimal majority dominating function of G.

Therefore g is minimal majority dominating function of G if and only if |P | = d n+1


2
e
and

46
1 if n is odd

Hence Γmaj (K1 , n − 1) = g(v)=
2 if n is even

Theorem: 3.14

Let G denoted the friendship graph with t triangles (u0 , ui , ui+t , u0 ), where 1 ≤ i ≤ t.
Then Γmaj (G) = 1

Proof:

Clearly, n = |V (G)| = 2t + 1 and hence d n2 e = t + 1.

Define g : V → {−1, 1} as follows.

g(ui ) = g(ui+t ) = 1if 1 ≤ i ≤ d 2t e

g(ui ) = 1 if t is even and i = d 2t e + 1

g(v) = −1 for all the remaining vertices.


(
t+1 if t is even
Then |S| =
t+2 if t is odd
(
1 if t is even
and k =
3 if t is odd

Clearly |S| − k < d n2 e and hence g is a minimal majority dominating function on G.

P
Thus Γmaj ≥ ui ∈V g(ui ) = 1

Now, let f : V → {−1, 1} be any minimal majority dominating function on G with


P
ui ∈V f (ui ) = Γmaj (G).
Hence |S| ≥ t + 1 and k > 0.

47
Now, suppose f (N [u0 ]) = Γmaj (G) ≥ 3.
Then |P | ≥ t + 2. Since f (N [u0 ]) ≥ 3 and k > 0,

we have f (u0 ) = −1. Hence f (N [ui ]) = 1 for all ui ∈ P .


Thus |S| ≥ t + 3 and k ≤ 2.
Now |S| − k > t + 1,

which is contradiction.

Hence Γmaj (G) ≤ 1. Thus Γmaj (G) = 1.

48
CONCLUSION

Graph theory enables us to study and modle networks and solve difficult problems
inherently capable of being modelled using nrtworks.

Various terms e.g. veretex and edge, are associated with graph theory which gives these
terms special meanings need to be understood and remember in order to apply graph the-
oretic approaches to solving problem.

When solving a peoblem by developing a graph -based program, careful attention must
be given at the design stage to the structuring of data to help make solving the problem
teactable,to enable linkages to be traced efficiently and to avoid duplication of data.

49
APPLICATIONS

The ideas and concepts of graph theory are widely used in various branches of science.

In general , without knowing the concepts of graph we also use these in our day to
day life. For example when we have to go to place which is connecting with our starting
point by different ways then we use the shortest rode to arrive the destination soon.

Here if we observe this problem from the point of view of graph theory the two places
can be considered as vertices and roads are as edges.
If we also consider the direction of travel then the graph must be directed.

Similarly ,we can use these concepts of graph theory in verious situations.

Here we are now going to discuss the applications of graph theory in various branches
of science:
Graph theory is used in chemistry for mathematical modelling of chemical phenomena.
We can make natural model of a molecule where vertices represent atoms and edges rep-
resent bond.

Graph theory is used in many areas of biology. Graphcan be drug target identification,
determining a protein’s orgene’s function.
Using these algorithums and programmes we can solve different theoritical problems.
There are some algorithms listed below.

Graph theory is a very usefule tool in operation research.


Now a days, Google map is very useful tool for travelling any where in the world.

50

You might also like