Generalized power domination in regular graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2013

Generalized power domination in regular graphs

Résumé

In this paper, we continue the study of power domination in graphs (see SIAM J. Discrete Math. 15 (2002), 519-529; SIAM J. Discrete Math. 22 (2008), 554-567; SIAM J. Discrete Math. 23 (2009), 1382-1399). Power domination in graphs was birthed from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A set of vertices is defined to be a power dominating set of a graph if every vertex and every edge in the system is monitored by the set following a set of rules (according to Kirschoff laws) for power system monitoring. The minimum cardinality of a power dominating set of a graph is its power domination number. We show that the power domination of a connected cubic graph on n vertices different from K3,3 is at most n/4 and this bound is tight. More generally, we show that for k ≥ 1 the k-power domination number of a connected (k + 2)-regular graph on n vertices different from Kk+2,k+2 is at most n/(k + 3), where the 1-power domination number is the ordinary power domination number. We show that these bounds are tight.
Fichier principal
Vignette du fichier
89135-powdomreg.pdf (275.68 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00903699 , version 1 (12-11-2013)

Identifiants

Citer

Paul Dorbec, Michael Antony Henning, Christian Löwenstein, Mickael Montassier, André Raspaud. Generalized power domination in regular graphs. SIAM Journal on Discrete Mathematics, 2013, 27 (3), pp.1559-1574. ⟨10.1137/120891356⟩. ⟨hal-00903699⟩

Collections

CNRS TDS-MACS
91 Consultations
352 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More