Published June 5, 2010
| Version v1
Book
Open
The Number of Minimum Dominating Sets in Pn × P2
Authors/Creators
Description
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set
if each vertex of G is dominated by at least k vertices of S. The Smarandachely k-domination number.