Roman domination number of the Cartesian products of paths and cycles
zbMATH Open1252.05167MaRDI QIDQ456341FDOQ456341
Authors: Polona Pavlič, Janez Žerovnik 
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p19
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Roman domination in regular graphs
- Some results for roman domination number on cardinal product of paths and cycles
- A note on the domination number of the Cartesian products of paths and cycles
- Roman domination number on cardinal product of paths and cycles
- Roman domination in Cartesian product graphs and strong product graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cited In (21)
- Roman domination number on cardinal product of paths and cycles
- Total Roman domination in the lexicographic product of graphs
- A note on the domination number of the Cartesian products of paths and cycles
- The 2-domination number of cylindrical graphs
- On the 2-domination Number of Cylinders with Small Cycles
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
- Formulas for various domination numbers of products of paths and cycles.
- Some results for roman domination number on cardinal product of paths and cycles
- Independent Roman domination and 2-independence in trees
- Independent rainbow domination of graphs
- Global double Roman domination in graphs
- Total Roman reinforcement in graphs
- Perfect double Roman domination of trees
- On rainbow domination numbers of graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- The secure domination number of Cartesian products of small graphs with paths and cycles
- Mixed Roman domination and 2-independence in trees
- Roman domination problem with uncertain positioning and deployment costs
- Roman domination in graphs
- Perfect Italian domination in trees
- Some improved inequalities related to Vizing's conjecture
This page was built for publication: Roman domination number of the Cartesian products of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456341)
