Roman Domination Number of the Cartesian Products of Paths and Cycles

Abstract

Roman domination is a historically inspired variety of general domination such that every vertex is labeled with labels from {0, 1, 2}. Roman domination number is the smallest of the sums of labels fulfilling condition that every vertex, labeled 0, has a neighbor, labeled 2. Using algebraic approach we give O(C) time algorithm for computing Roman domination… (More)

Topics

17 Figures and Tables

Statistics

0204060201520162017
Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Pavlic2012RomanDN, title={Roman Domination Number of the Cartesian Products of Paths and Cycles}, author={Polona Pavlic and Janez Zerovnik}, journal={Electr. J. Comb.}, year={2012}, volume={19}, pages={P19} }