Sciweavers

FCS
2009
13 years 8 months ago
Domination and Independence on the Rectangular Torus by Rooks and Bishops
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
Joe DeMaio, William Faust