Skip navigation
Skip navigation

Connected domination of regular graphs

Duckworth, William; Mans, Bernard

Description

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

dc.contributor.authorDuckworth, William
dc.contributor.authorMans, Bernard
dc.date.accessioned2015-12-08T22:38:39Z
dc.identifier.issn0012-365X
dc.identifier.urihttp://hdl.handle.net/1885/35895
dc.description.abstractA 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
dc.publisherElsevier
dc.sourceDiscrete Mathematics
dc.subjectKeywords: Ad hoc networks; Mobile telecommunication systems; Connected; Domination; Graphs; Random; Regular; Graph theory Connected; Domination; Graphs; Random; Regular
dc.titleConnected domination of regular graphs
dc.typeJournal article
local.description.notesImported from ARIES
local.identifier.citationvolume309
dc.date.issued2009
local.identifier.absfor010399 - Numerical and Computational Mathematics not elsewhere classified
local.identifier.ariespublicationu9209279xPUB129
local.type.statusPublished Version
local.contributor.affiliationDuckworth, William, College of Physical and Mathematical Sciences, ANU
local.contributor.affiliationMans, Bernard, Macquarie University
local.description.embargo2037-12-31
local.bibliographicCitation.issue8
local.bibliographicCitation.startpage2305
local.bibliographicCitation.lastpage2321
local.identifier.doi10.1016/j.disc.2008.05.029
dc.date.updated2016-02-24T11:54:37Z
local.identifier.scopusID2-s2.0-62849121963
CollectionsANU Research Publications

Download

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