On the (r,s)-domination number of a graph

On the (r,s)-domination number of a graph

Thesis (PhD)--Stellenbosch University, 2014. === 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. Since its introduction t...

Full description

Bibliographic Details
Main Author: Roux, Adriana
Other Authors: Van Vuuren, J. H.
Format: Others
Language:en_ZA
Published: Stellenbosch : Stellenbosch University 2014
Subjects:
(r,s)-domination
Integer domination
Dissertations > Logistics
Theses > Logistics
Facilities > Location > Mathematical models
Logistics > Mathematical models
UCTD
Online Access:http://hdl.handle.net/10019.1/86266

Internet

http://hdl.handle.net/10019.1/86266

Similar Items