Discussiones Mathematicae Graph Theory · 2011 · 55 citations · 7 references
ComputingComputer ScienceAlgorithmsCombinatoricsComputational GeometryDirected Acyclic GraphsDominance HierarchiesGraph AlgorithmsGraph TheoryDominance AnalysisDominating SetsTree AlgorithmsTree-graph
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.
7
E. J. Cockayne, Paul Dreyer, Sandra M. Hedetniemi et al. · Discrete Mathematics · 2003 · 556 citations
Ian Stewart · Scientific American · 1999 · 359 citations
Humanities, Classics, History +8
Defending the Roman Empire—A new strategy
Michael A. Henning, Stephen T. Hedetniemi · Discrete Mathematics · 2003 · 144 citations
Humanities, History, Ancient History +12
A characterization of Roman trees
Michael A. Henning · Discussiones Mathematicae Graph Theory · 2002 · 96 citations