The distance Roman domination numbers of graphs
Work
Year: 2013
Type: article
Abstract: Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0; 1; 2} such that for every vertex with label 0,... more
Institution Azarbaijan Shahid Madani University
Cites: 9
Cited by: 11
Related to: 10
FWCI: 0.571
Citation percentile (by year/subfield): 74.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: diamond