Volume 49 | Number 3 | Year 2017 | Article Id. IJMTT-V49P523 | DOI : https://doi.org/10.14445/22315373/IJMTT-V49P523

Let G=(V,E) be a simple, finite, connected and undirected graph. A non- empty subset D of V(G) in a graph G=(V,E) is a dominating set if every vertex in V-D is adjacent to atleast one vertex in D. The domination number γ(G) of G is the minimum cardinality of a minimal dominating set of G. A non-empty subset D of V(G) is called an equitable dominating set of a graph G if for every , there exists a vertex such that and . The minimum cardinality of such a minimal dominating set is denoted by γe(G) and is called an equitable domination number of G. A dominating set D of graph G is called a split dominating set, if the induced subgraph is disconnected. Let denote the greatest integer not greater than and denote the least integer not less than x . In this paper, we investigated the split, inverse and equitable domination number of the middle and the central graphs of the path Pn and the cycle Cn.

[1] Ameenal Bibi k and selvakumar, R, The inverse strong non split r- domination number of a graph, International journal of Engineering Science and Technology vol.2,No .1 2010,pp.127-133.

[2] Ameenal Bibi k and selvakumar, R (2008). The inverse split and non-split domination in graphs proc. of the inter, conf on Mathematics and Computer Science, ICMCS 2008, Loyola college, Chennai-600 034. July 25-26.

[3] J. Arockia Aruldass and G. Gurulakshmi, The domination coloring of central and Middle graph of some special graphs. Int. Jour. Mathematics and its applications Volume 4, issue 4 (2016).

[4] Dauta Michalak, On Middle and total graphs with coarseness number equal; Graph theory proc. conf. Lagow|p0|. 1981 Lec. Notes math. 1618 Springer.

[5] Harary, Frank (1969) Graph Theory, Reading MA: Addison-Wesley.

[6] Hayner, T.W. Hedetniemi, S.T. and Slater, P.J. Domination in Graphs. Advanced topics. New York: Dekker 1998.

[7] Hayner, T.W. Hedetniemi, S.T, and Slater, P.J. Fundamentals of domination in graphs New York: Dekker 1998.

[8] Kavitha B.N and Indrani Kelkar, Split and Equitable domination in Book graph and Stacked book graph, Int. Jour. Ad. Research in computer science, Volume 8, No.6, July 2017.

[9] Kulli, V.R. and Janakiram.B, The split domination number of a graph, Graph theory notes of New York, xxxii (1997) (16-19).

[10] Kulli, V.R. and Janakiram.B, The non split domination number of a graph, Indian journal of pure, Appl. Math., 31(5) (2000) 545-550.

[11] V.R. Kulli and S.C. Sigarkanti, Inverse domination in graphs, Nat. Acad. Sci. Lect. 14 (1991) 473-475.

[12] Sivakumar.S and N.D Soner Inverse equitable domination in graphs, Research journal of pure Algebra-2(9), 2012, page:279-285.

[13] V. Swaminathan and K.M. Dharmalingam, Degree equitable domination on graphs, kragujevak Journal of Mathematics, 35(1), 191-197 (2011).

[14] Vernold Vivin.J PhD Thesis, Harmonious coloring of Total graphs, n-leaf, central graphs and circumdetic Graphs, Bharathias University, (2007).

K. Ameenal Bibi, P.Rajakumari, "The Split Domination, Inverse Domination and Equitable Domination in the Middle and the Central graphs of the Path and the Cycle graphs," *International Journal of Mathematics Trends and Technology (IJMTT)*, vol. 49, no. 3, pp. 168-173, 2017. *Crossref*, https://doi.org/10.14445/22315373/IJMTT-V49P523