Weak Roman domination in graphs
Copyright policy ) T. N. M. Malini Mai; P. Roushini Leely Pushpam;
Weak Roman domination in graphs
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.
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).23 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 23
Top 10%
Top 10%
Average
Published in a Diamond OA journal
Fields of Science (4) View all