Closed formulas for the total Roman domination number of lexicographic product graphs

DOI10.26493/1855-3974.2284.aebzbMath1485.05128OpenAlexW3135985610WikidataQ113703572 ScholiaQ113703572MaRDI QIDQ3390051

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

Publication date: 24 March 2022

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.2284.aeb

zbMATH Keywords

total dominationtotal Roman dominationlexicographic product graph

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 (3)

Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ On the 2-packing differential of a graph

Cites Work

• Roman domination on strongly chordal graphs
• On the roman domination in the lexicographic product of graphs
• Double domination in lexicographic product graphs
• A survey of selected recent results on total domination in graphs
• Total Roman domination in the lexicographic product of graphs
• On the super domination number of lexicographic product graphs
• On the weak Roman domination number of lexicographic product graphs
• Rainbow domination in the lexicographic product of graphs
• Associative graph products and their independence, domination and coloring numbers
• On the Algorithmic Complexity of Total Domination
• Total Domination in Graphs
• Total Roman domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Closed formulas for the total Roman domination number of lexicographic product graphs