On the roman domination in the lexicographic product of graphs
From MaRDI portal
Publication:442220
DOI10.1016/J.DAM.2012.04.008zbMath1246.05124OpenAlexW2158057601MaRDI QIDQ442220
Tadeja Kraner Šumenjak, Polona Pavlič, Aleksandra Tepeh Horvat
Publication date: 10 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.008
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (25)
A note on Roman domination of digraphs ⋮ Geodesic transversal problem for join and lexicographic product of graphs ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Semitotal domination number of some graph operations ⋮ 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 ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Partially composed property of generalized lexicographic product graphs ⋮ Gromov hyperbolicity in lexicographic product graphs ⋮ Rainbow domination in the lexicographic product of graphs ⋮ Double total domination in the generalized lexicographic product of graphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ Domination-related parameters in rooted product graphs ⋮ On the 2-packing differential of a graph ⋮ Roman Domination in Graphs ⋮ (1, 2)-DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS ⋮ FORCING DOMINATION NUMBERS OF GRAPHS UNDER SOME BINARY OPERATIONS ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Protection of lexicographic product graphs ⋮ Unnamed Item ⋮ Double domination in lexicographic product graphs ⋮ Nearly tight approximation algorithm for (connected) Roman dominating set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the domination number and the total domination number of direct product graphs
- Dominating direct products of graphs
- A survey of selected recent results on total domination in graphs
- Roman domination in regular graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Roman domination in graphs.
- Unique response Roman domination in graphs
- Associative graph products and their independence, domination and coloring numbers
- Extremal Problems for Roman Domination
- Total domination in graphs
This page was built for publication: On the roman domination in the lexicographic product of graphs
