Title of article
Roman {2}-domination in Graphs and Graph Products
Author/Authors
Alizadeh ، F. Mathematics Section, Department of Basic Sciences - Shahid Rajaee Teacher Training University , Maimani ، H. R. Mathematics Section, Department of Basic Sciences - Shahid Rajaee Teacher Training University , Parsaei Majd ، L. Mathematics Section, Department of Basic Sciences - Shahid Rajaee Teacher Training University , Rajabi Parsa ، M. Mathematics Section, Department of Basic Sciences - Shahid Rajaee Teacher Training University
From page
117
To page
126
Abstract
For a graph G = (V, E) of order n, a Roman {2}-dominating function f : V → {0, 1, 2} has the property that for every vertex v ∈ V with f(v) = 0, either v is adjacent to a vertex assigned 2 under f, or v is adjacent to at least two vertices assigned 1 under f. In this paper, we classify all graphs with Roman {2}-domination number belonging to the set {2, 3, 4, n − 2, n − 1, n}. Furthermore, we obtain some results about Roman {2}-domination number of some graph operations.
Keywords
Roman {2} , domination , Cartesian product , Grid graph
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Record number
2758687
Link To Document