On the weak Roman domination number of lexicographic product graphs
From MaRDI portal
Publication:2420431
DOI10.1016/j.dam.2018.03.039zbMath1414.05233arXiv1705.04735OpenAlexW2962962076WikidataQ57974173 ScholiaQ57974173MaRDI QIDQ2420431
Magdalena Valveny, Hebert Pérez-Rosés, Juan Alberto Rodríguez-Velázquez
Publication date: 6 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.04735
total dominationweak Roman dominationlexicographic productdomination in graphsdouble total domination
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Weak Roman domination in rooted product graphs ⋮ Total protection of lexicographic product graphs ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ Secure Italian domination in graphs ⋮ On the 2-packing differential of a graph ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Protection of lexicographic product graphs ⋮ Double domination in lexicographic product graphs ⋮ Constructive characterizations concerning weak Roman domination in trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the roman domination in the lexicographic product of graphs
- Relations between packing and covering numbers of a tree
- Roman domination in graphs.
- Total and paired-domination numbers of a tree
- Defending the Roman Empire---a new strategy
- On the super domination number of lexicographic product graphs
- Rainbow domination in the lexicographic product of graphs
- On the corona of two graphs
- Associative graph products and their independence, domination and coloring numbers
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Total domination in graphs
- Domination in planar graphs with small diameter*
- Total Domination in Graphs
