论文信息 - Secure domination in rooted product graphs - 字舞流文

Secure domination in rooted product graphs

Juan A. Rodríguez-Velázquez | Luis Pedro Montejano | Rangel Hernández-Ortiz

[1] Toru Araki,et al. On the secure domination numbers of maximal outerplanar graphs , 2018, Discret. Appl. Math..

[2] J. J. Liu,et al. A simple algorithm for secure domination in proper interval graphs , 2019, Discret. Appl. Math..

[3] J. A. Rodríguez-Velázquez,et al. Protection of graphs with emphasis on Cartesian product graphs , 2020, Filomat.

[5] Michael A. Henning,et al. Vertex Covers and Secure Domination in Graphs , 2008 .

[6] Toru Araki,et al. Secure domination in cographs , 2019, Discret. Appl. Math..

[7] Dinabandhu Pradhan,et al. On computing a minimum secure dominating set in block graphs , 2018, J. Comb. Optim..

[8] Dinabandhu Pradhan,et al. The secure domination problem in cographs , 2019, Inf. Process. Lett..

[9] Ernest J. Cockayne. Irredundance, secure domination and maximum degree in trees , 2007, Discret. Math..

[10] Mustapha Chellali,et al. On Secure Domination in Graphs , 2015, Inf. Process. Lett..

[11] William Klostermeyer,et al. Secure domination and secure total domination in graphs , 2008, Discuss. Math. Graph Theory.