Connected domination of regular graphs
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
|Collections||ANU Research Publications|
|01_Duckworth_Connected_domination_of_2009.pdf||732.65 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.