Split and Equitable Domination of Some Special Graph

Author(s):

Dr. C S Nagabhushana , HKBK College Of Engineering College; Kavitha B N, Sri Venkateshwara College Of Engineering College; H M Chudamani, A.S.C College

Keywords:

Domination, Split domination, Friendship graph? F?_n, Windmill graph Wd(m, n )

Abstract:

A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv∈ E(G) and |deg(u) − deg(v)| ≤ 1. The minimum cardinality of such a dominating set is denoted by γ^e (G) and is called equitable domination number of G. A dominating set D of graph G is called a split dominating set, if the induced sub graph is disconnected. In this paper we introduce split and equitable domination of Friendship graph〖 F〗_n and Windmill graph Wd(m ,n), then we find the split and equitable domination of F_n (V-D).

Other Details:

Manuscript Id	:	IJSTEV4I2037
Published in	:	Volume : 4, Issue : 2
Publication Date	:	01/09/2017
Page(s)	:	50-54

Download Article