McRae, Alice

asu

There are 2 item/s.

TitleDateViewsBrief Description
A Study Of The Upper Domatic Number Of A Graph 2017 912 Given a graph G we can partition the vertices of G in to k disjoint sets. We say a set A of vertices dominates another set of vertices, B, if for every vertex in B there is some adjacent vertex in A. The upper domatic number of a graph G is written a...
Minimal Restrained Domination Algorithms on Trees Using Dynamic Programming 2013 2151 In this paper we study a special case of graph domination, namely minimal restrained dominating sets on trees. A set S ? V is a dominating set if for every vertex u ? V-S, there exists v ? S such that uv ? E. A set S ? V is a restrained dominating se...