[1]. T. W. Haynes, S. Hedetniemi, and P. Slater, “Fundamentals of dominationin graphs,” CRC Press, 1998.##
[2]. M. Rajaati Bavil Olyaei and M. R. Hooshmandasl, “Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme,” Jourrnal of Electronical & Cyber Defence, vol. 7, no. 3, pp. 105-111, 2019. (In Persian).##
[3]. N. Biggs, “Perfect codes in graphs,” J. Comb. Theory. B., vol. 15, no. 3, pp. 289-296, 1973.##
[4]. S. Hamid and S. Balamurugan, “Isolate domination in graphs,” Arab Journal of
Mathematical Sciences, vol. 22, no. 2, pp. 232-
241, 2016.##
[5]. N. J. Rad, “Some notes on the isolate domination in graphs,” AKCE International Journal of Graphs and Combinatorics, vol. 14, no. 2, pp. 112-117, 2017.##
[6]. G. Rajasekar and A. Jeslet Kani Bala, “𝑘-Isolate domination number of simple graphs,” Malaya Journal of Matematik, vol. S, no. 1, pp. 113-115, 2019.##
[7]. E. Cockayne, S. Goodman, S. Hedetniemi, “A linear algorithm for the domination number of a tree,” Inform. Process. Lett., vol. 4, no. 2, pp. 41-44, 1975.##
[8]. M. R. Garey and D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-##
)
