Now showing items 1-1 of 1
On the (r,s)-domination number of a graph
(Stellenbosch : Stellenbosch University, 2014-04)
ENGLISH ABSTRACT: The (classical) domination number of a graph is the cardinality of a smallest subset of its vertex set with the property that each vertex of the graph is in the subset or adjacent to a vertex in the subset. ...