Total Roman domination in the lexicographic product of graphs
From MaRDI portal
Publication:2420413
DOI10.1016/j.dam.2018.06.008zbMath1414.05221OpenAlexW2810329258MaRDI QIDQ2420413
Dorota Kuziak, Nicolas Campanelli
Publication date: 6 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.008
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (14)
Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Total \(k\)-domination in Cartesian product of complete graphs ⋮ Note on the perfect Roman domination number of graphs ⋮ Total Roman domination edge-critical graphs ⋮ On the 2-packing differential of a graph ⋮ Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs ⋮ Varieties of Roman Domination ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ Total Roman {2}-domination in graphs ⋮ Double domination in lexicographic product graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- On the roman domination in the lexicographic product of graphs
- Roman domination number of the Cartesian products of paths and cycles
- Upper bounds on Roman domination numbers of graphs
- A survey of selected recent results on total domination in graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- On the total domination number of Cartesian products of graphs
- An improvement on Vizing's conjecture
- Signed Roman domination in graphs
- Perfect codes in graphs
- Odd neighborhood transversals on grid graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Associative graph products and their independence, domination and coloring numbers
- On Clark and Suen bound-type results fork-domination and Roman domination of Cartesian product graphs
- Roman Domination on 2-Connected Graphs
- Open k-monopolies in graphs: complexity and related concepts
- Vizing's conjecture: a survey and recent results
- Extremal Problems for Roman Domination
- On the domination of the products of graphs II: Trees
- Total Domination in Graphs
- Roman domination in Cartesian product graphs and strong product graphs
- Total Roman domination in graphs
This page was built for publication: Total Roman domination in the lexicographic product of graphs
