Roman domination number of the Cartesian products of paths and cycles

zbMath1252.05167MaRDI QIDQ456341

Janez Žerovnik, Polona Pavlič

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

zbMATH Keywords

algorithmCartesian productRoman dominationpolygraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (17)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ On the 2-domination Number of Cylinders with Small Cycles ⋮ Independent Roman domination and 2-independence in trees ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Total Roman domination in the lexicographic product of graphs ⋮ The 2-domination number of cylindrical graphs ⋮ Independent rainbow domination of graphs ⋮ Some improved inequalities related to Vizing's conjecture ⋮ On rainbow domination numbers of graphs ⋮ Perfect Italian domination in trees ⋮ Mixed Roman domination and 2-independence in trees ⋮ Roman Domination in Graphs ⋮ Total Roman reinforcement in graphs ⋮ The secure domination number of Cartesian products of small graphs with paths and cycles ⋮ Perfect double Roman domination of trees ⋮ Roman domination problem with uncertain positioning and deployment costs ⋮ Global double Roman domination in graphs

This page was built for publication: Roman domination number of the Cartesian products of paths and cycles