|
[1] K. T. Chu, W. H. Lin, C. Chen, Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs, Discrete Appl. Math. 259 (2019) 41–52.
[2] J. F. Fink, M. S. Jacobson, L. F. Kinch, J. Roberts, The bondage number of a graph, Discrete Math. 86 (1990) 47–57.
[3] S. Fujita, A tight bound on the number of mobile servers to guarantee transferability among dominating configurations, Discrete Appl. Math. 158 (2010) 913–920.
[4] D. Gonc ̧alves, A. Pinlou, M. Rao, S. Thomass ́e, The domination number of grids, SIAM J. Discrete Math. 25 (2011) 1443–1453.
[5] T. W. Haynes, S. T. Hedetniemi, P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
[6] T. W. Haynes, S. T. Hedetniemi, P. J. Slater (Eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
|