Secure domination in rooted product graphs

DOI10.1007/s10878-020-00679-wzbMath1464.05289OpenAlexW3120145815MaRDI QIDQ2025078

Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00679-w

zbMATH Keywords

rooted product graphssecure dominationcorona product graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irredundance, secure domination and maximum degree in trees
• On the secure domination numbers of maximal outerplanar graphs
• On computing a minimum secure dominating set in block graphs
• The secure domination problem in cographs
• A simple algorithm for secure domination in proper interval graphs
• On secure domination in graphs
• Secure domination in cographs
• Vertex Covers and Secure Domination in Graphs
• Secure domination and secure total domination in graphs
• Protection of graphs with emphasis on Cartesian product graphs
• On secure domination in trees

This page was built for publication: Secure domination in rooted product graphs