Open AccessWeak Roman domination in graphs
Author(s) -
T. N. M. Malini,
P. Roushini Leely Pushpam
Publication year - 2011
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1532
Subject(s) - mathematics , combinatorics , domination analysis , graph , vertex (graph theory)
0(w) = f(w) if w 2 V − fu,vg, has no undefended vertex. The weight of f is w(f) = P v2V f(v). The weak Roman domination number, denoted by r(G), is the minimum weight of a WRDF in G. In this paper, we characterize the class of trees and split graphs for which r(G) = (G) and find r-value for a caterpillar, a 2 n grid graph and a complete binary tree.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom