Total protection of lexicographic product graphs

DOI10.7151/dmgt.2318zbMath1492.05110OpenAlexW3017862626MaRDI QIDQ2151225

Juan Alberto Rodríguez-Velázquez, Abel Cabrera Martínez

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2318

zbMATH Keywords

total dominationlexicographic productsecure total dominationtotal weak Roman domination

Mathematics Subject Classification ID

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

Related Items (1)

From \(w\)-domination in graphs to domination parameters in lexicographic product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Double Roman domination
• Italian domination in trees
• Bounds on weak Roman and 2-rainbow domination numbers
• Relations between packing and covering numbers of a tree
• Roman domination in graphs.
• Perfect Italian domination in trees
• Secure total domination in graphs: bounds and complexity
• Defending the Roman Empire---a new strategy
• On the weak Roman domination number of lexicographic product graphs
• Secure domination and secure total domination in graphs
• Total domination in graphs
• Total Domination in Graphs

This page was built for publication: Total protection of lexicographic product graphs