Algorithmic Aspects of Some Variants of Domination in Graphs

[1] A.A. Bertossi, Dominating sets for split and bipartite graphs. Information Processing Letters, 19 (1984), no. 1, pp.37-40.10.1016/0020-0190(84)90126-1Search in Google Scholar

[2] M. Chlebík and J. Chlebíkov, The complexity of combinatorial optimization problems on d-dimensional boxes. SIAM Journal on Discrete Mathematics, 21 (2007), no. 1, pp.158-169.10.1137/050629276Search in Google Scholar

[3] E.J. Cockayne, P.J.P. Grobler, W.R. Grundlingh, J. Munganga, and J.H. van Vuuren, Protection of a graph, Utilitas Mathematica, 67 (2005), pp. 19-32.Search in Google Scholar

[4] D.G. Corneil, and Y. Perl, Clustering and domination in perfect graphs, Discrete Applied Mathematics, 9 (1984), pp. 27-39.10.1016/0166-218X(84)90088-XSearch in Google Scholar

[5] B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comp. 85(1) (1990) 64-75.10.1016/0890-5401(90)90043-HSearch in Google Scholar

[6] A.P. De Villiers, Edge criticality in secure graph domination, Ph.D. Dissertation Stellenbosch: Stellenbosch University, (2014).Search in Google Scholar

[7] M.R. Garey, and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, (1979).Search in Google Scholar

[8] M.C. Golumbic, and C.F. Goss, Perfect elimination and chordal bipartite graphs, Journal of Graph Theory, 2 (1978), no. 2, pp. 155-163.10.1002/jgt.3190020209Search in Google Scholar

[9] I.S. Hamid, and S. Balamurugan, Isolate domination in graphs, Arab Journal of Mathematical Sciences, 22 (2016), no. 2, pp. 232-241.10.1016/j.ajmsc.2015.10.001Search in Google Scholar

[10] T.W. Haynes, S.T. Hedetniemi, and P. Slater, Fundamentals of domination in graphs, CRC Press, (1998).10.1002/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-FSearch in Google Scholar

[11] T.W. Haynes, S.T. Hedetniemi, and P. Slater, Domination in graphs: advanced topics, Marcel Dekker, (1997).Search in Google Scholar

[12] R.M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, (1972), pp. 85-103.10.1007/978-1-4684-2001-2_9Search in Google Scholar

[13] J.P. Kumar, P.V.S. Reddy, Algorithmic Aspects of Secure Connected Domination in Graphs, Discussiones Mathematicae Graph Theory (Article in press).Search in Google Scholar

[14] N.V. Mahadev, and U.N. Peled, Threshold graphs and related topics, 56, North Holland, (1995).Search in Google Scholar

[15] H.B. Merouane, and M. Chellali, On secure domination in graphs, Information Processing Letters, 1150 (2015), pp. 786-790.10.1016/j.ipl.2015.05.006Search in Google Scholar

[16] B.S. Panda, Arti Pandey, and S. Paul, Algorithmic aspects of b-disjunctive domination in graphs, Journal of Combinatorial Optimization, 36 (2018), pp. 572-590.10.1007/s10878-017-0112-6Search in Google Scholar

[17] D. Pradhan, A. Jha, On computing a minimum secure dominating set in block graphs, Journal of Combinatorial Optimization, 35 (2018), no. 2, pp. 613-631.10.1007/s10878-017-0197-ySearch in Google Scholar

[18] N.J. Rad, Some notes on the isolate domination in graphs, AKCE International Journal of Graphs and Combinatorics, 14 (2017), no. 2, pp. 112-117.10.1016/j.akcej.2017.01.003Search in Google Scholar