Restrained domination in signed graphs

[1] F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1969.10.21236/AD0705364Search in Google Scholar

[2] T. Zaslavsky, Signed graphs, Discrete Applied Mathematics, 4 (1982), 47–74.10.1016/0166-218X(82)90033-6Search in Google Scholar

[3] F. Harary, On the notion of balance of a signed graph, The Michigan Mathematical Journal, 2 (1953), 143–146.10.1307/mmj/1028989917Search in Google Scholar

[4] T. W. Haynes, S. Hedetniemi, P. Slater, Fundamentals of domination in graphs, CRC press, 2013.10.1201/9781482246582Search in Google Scholar

[5] B. D. Acharya, Domination and absorbance in signed graphs and di-graphs. I: Foundations, The Journal of Combinatorial Mathematics and Combinatorial Computing, 84 (2013), 1–10.Search in Google Scholar

[6] K. A. Germina, P. Ashraf, On open domination and domination in signed graphs, International Mathematical Forum, 8 (2013), 1863–1872.10.12988/imf.2013.310198Search in Google Scholar

[7] K. A. Germina, P. Ashraf, Double domination in signed graphs, Cogent Mathematics, 3 (2016), 1–9.10.1080/2331205X.2016.1237605Search in Google Scholar

[8] H. B. Walikar, S. Motammanavar, B. D. Acharya, Signed domination in signed graphs, Journal of Combinatorics and System Sciences, 40 (2015), 107–128.Search in Google Scholar

[9] G. S. Domke, J. H. Hattingh, S. T. Hedetniemi, R. C. Laskar, L. R. Markus, Restrained domination in graphs, Discrete Mathematics, 203 (1999), 61–69.10.1016/S0012-365X(99)00016-3Search in Google Scholar