Independent [1,2]-number versus independent domination number

[1] D.W. Bange, A.E. Barkauskas, P.J. Slater, E_cient dominating sets in graphs, Applications of Discrete Mathematics. Proceedings of the Third SIAM Conference on Discrete Mathematics (1986) 189-199.Search in Google Scholar

[2] G. Chartrand, L. Lesniak, P. Zhang, Graphs and Digraphs, (5th edition), CRC Press,,2011.10.1201/b14892Search in Google Scholar

[3] M. Chellali, S.T. Hedetniemi and A. McRae, [1; 2]-set in graphs, Discrete Appl. Math. 161 (2013), 2885-2893.10.1016/j.dam.2013.06.012Search in Google Scholar

[4] M. Chellali, O. Favaron, T.W. Haynes, S.T. Hedetniemi and A. McRae, Independent [1; k]-sets in grahps, Australas. J. Combin. 59(1) (2014), 144-156.Search in Google Scholar

[5] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domi- nation in Graphs, Marcel Dekker Inc., 1998.Search in Google Scholar

[6] M. Livingston, Q.F. Stout, Perfect Dominating Sets, Congr. Numer., 79 (1990), 187-203.Search in Google Scholar

[7] E.B. Santoso, R.M. Marcelo, Existence on independent [1; 2]-sets in cater- pillars, Proceedings of the 7th SEAMUS UGM International Conference on Mathematics and its Applications 2015. AIP Conference Proceedings, 1707 (2016), ]020019.Search in Google Scholar