CHAPTER 1 Discussions of Results

1.1

The Edge Domination Number of Corona of Graphs

Theorem 1.1.1. For any path graph Pm , (Pm ) =

m1 3

.
m 3

Proof. Let Cm be a cycle graph of size m. Now, (Cm ) =

where m is

the size of the cycle. Consider a path Pn1 . A path Pn1 Cm1 . Therefore, = (Pn1 ) =
m1 3 n1 3

. A path Pm of order m has m 1 edges, then (Pm ) =

Theorem 1.1.2. Let G = H K where H and K are connected graphs. (i). Let S = vV (H) Sv where Sv E(Kv + v) is an EDS in Kv + v such that for all v V (H), vw Sv for some w V (Kv ). If (Kv + v) (Kv ) then S is a minimum EDS in G. (ii) Let S = (vV (H) Sv ) T where Sv is a minimum EDS in Kv and T is an EDS in H such that for every vertex v in H, v is an end vertex of edge e in T . If (Kv + v) > (Kv ) then S is a minimum EDS in G. Proof. (i) By denition, we have S an EDS in G. Now to show that S is the minimum EDS in G is to show that Sv is the minimum EDS in Kv +v. Suppose

2 there exists a set Sv , a minimum EDS in Kv + v, where Sv E(Kv + v) but Sv Sv = . Then there exists edge f Sv but f E(Kv + v), hence f / E(H). Let f = uv where u, v V (H). Then E(Kv +v)\E(Kv ) Ne [f ]. Since Sv is an EDS then there exists set A Sv such that Ne [A] = E(Kv ). Hence, A {f } = Sv . From our assumption, we have (Kv + v) (Kv ) implying that min|Sv | min|A|, hence min|Sv | < min|A| + 1 = |Sv |, a contradiction of Sv being the minimum EDS. Hence, Sv is the minimum EDS in Kv + v. It follows that S = vV (H) Sv is a minimum EDS in G. (ii) By denition, we have S an EDS in G. Now to show that S is the minimum EDS in G. Suppose there exists set S = (vV (H) Sv )T , a minimum EDS in G. Let S = vV (H) Sv where Sv E(Kv + v) is a minimum EDS in Kv + v. From our assumption, we have (Kv + v) > (Kv ), so we can assume that (Kv ) = (Kv + v) 1. Now |S | = and |S| = v) 1) + G.
vV (H) |V (H)| 2 vV (H)

|Sv | = |V (H)| (Kv + v) = |V (H)|( (Kv +

|Sv | + |T | = |V (H)| (Kv ) +

|V (H)| 2

. Clearly, |S | > |S|. Therefore S is the minimum EDS in