The Non-Split Complement Line Domination in Graphs

V. Mohanaselvi, P. Kavitha, M. Durka Devi

Abstract


Harary and Norman introduced the Line graph \(L(G)\). We introduced the split complement line domonation number by posting the disconnected property on the dominating sets of \(\overline{L(G)}\). In this paper, we study the connectedness property of dominating sets of \(\overline{L(G)}\) by defining non-split domination parameter. Also, we studied its graph theoretical properties in terms of elements of \(G\).

Keywords


Graph; Line graph; Domination number; Line domination number; Split line domination number; Split complement line domination number

Full Text:

PDF

References


F. Harary, Graph Theory, Addison-Wesley, Reading Mass. (1969).

F. Harary, Graph Theory, Addison-Wesley Publication, Reading—Massachusetts—Menlo Park—California—London, pp. 71 – 83 (1972).

F. Harary and R.Z. Norman, Some properties of line graphs, Rendiconti del circolo mathematico di palmero 9 (2) (1960), 166 – 168.

T.W. Hayness, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel-Dekker, Inc., New York (1998)

V.R. Kulli and B. Janakiram, The non-split domination number of graph, Indian J. Pure and Appl. Math. 31 (4) (2000), 545 – 550.

V.R. Kulli, Theory of Domination in Graphs, Vishwa International Publication, Gulbarga, India (2010).

M.H. Muddebihal, U.A. Panfarosh and Anil R. Seetamkar, Split line domination in graphs, International Journal of Science and Research 3 (8) (2014), 1163 – 1166.

O. Ore, Theory of graphs, Amer. Math. Soc. Colloq. Publ., 38, Providence (1962).

D.F. Rall, Dominating a graph and its complement, Congressus Numerantium 80 (1991), 89 – 95.

E. Sampathkumar, The global domination number of a graph, J. Math. Phys. Sci. 23 (1989), 377 – 385.




DOI: http://dx.doi.org/10.26713%2Fjims.v9i3.761

eISSN 0975-5748; pISSN 0974-875X