Skip navigation
Skip navigation

Connected domination of regular graphs

Duckworth, William; Mans, Bernard


A dominating setD of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating setC of a

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Discrete Mathematics
DOI: 10.1016/j.disc.2008.05.029


File Description SizeFormat Image
01_Duckworth_Connected_domination_of_2009.pdf732.65 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator