International Journal of Mathematics Trends and Technology
Volume 57 | Number 1 | Year 2018 | Article Id. IJMTT-V57P503 | DOI : https://doi.org/10.14445/22315373/IJMTT-V57P503
A dominating set D of a jump graph J(G)=(V, E) is a split dominating set if the induced sub graph < V-D > is disconnected.A split dominating number √s(J(G)) of jump graph J(G) is the minimum cardinality of a split dominating set. In this paper we study split dominating sets and investigate the relation of √s(J(G)) with other known parameters of J(G).
[1] E.J Cockayne and S.T. Hedetniemi; Towards a heory of domination in graphs Networks 7,247-261 (1977)
[2] V.R.Kulli and B.Janakiram, The minimal dominating graphs, Graph Theory Notes of New York XXVIII;3 New York Academy of Sciences 12-15(1995)
[3] V.R.Kulli and B.Janakiram, The split domination number of a graph , Graph Theory Notes of New York XXXII;7 New York Academy of Sciences 16-19(1997)
[4] S.Zhou and X. Yue Gallai type equalities for f-domination and connected f-dominating number, Graph Theory Notes of New York XXIX;7 New York Academy of Sciences 30-32(1995)
[5] V.R.Kulli and B.Janakiram, The non-bondage a graph. Graph Theory Notes of New York XXX;4 New York Academy of Sciences 14-16(1996)
[6] F. Harary, Addison Wesley Reading Mass(1969)
[7] .Sampathkumar and HJ.B.Walikar; The connected domination number of a graph, J.Math.Phy.Sci 13,607-613(1979)
[8] E.A. Nordhaus and J.W. Gaddum, on complementary graph, Amer.Math Monthly 63,175-177 (1956)
[9] Anupama S.B.,, Y.B.Maralbhavi and V.M Goudar, some domination parameters in jump graphs International jounal of pure and applied mathematics vol 113 No.10 47-5792017).
N.Pratap Babu Rao, Sweta.N, "The Split Domination of a Jump Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 57, no. 1, pp. 21-23, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V57P503
PDF 
Abstract 
Keywords 
References 
Citation