k-Power domination in block graphs

Chao Wang; Lei Chen; Changhong Lu

doi:10.1007/s10878-014-9795-0

k-Power domination in block graphs

Chao Wang, Lei Chen, Changhong Lu

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating set in graphs. The concept of k-power domination, first introduced by Chang et al. (Discret Appl Math 160:1691–1698, 2012), is a common generalization of domination and power domination. In this paper, we present a linear-time algorithm for k-power domination in block graphs.

Original language	English
Pages (from-to)	865-873
Number of pages	9
Journal	Journal of Combinatorial Optimization
Volume	31
Issue number	2
DOIs	https://doi.org/10.1007/s10878-014-9795-0
State	Published - 1 Feb 2016

Keywords

Block graphs
Domination
Electrical network monitoring
Power domination

Access to Document

10.1007/s10878-014-9795-0

Cite this

@article{9850b1311bbd49f29fce2e62cd8bb38b,

title = "k-Power domination in block graphs",

abstract = "The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating set in graphs. The concept of k-power domination, first introduced by Chang et al. (Discret Appl Math 160:1691–1698, 2012), is a common generalization of domination and power domination. In this paper, we present a linear-time algorithm for k-power domination in block graphs.",

keywords = "Block graphs, Domination, Electrical network monitoring, Power domination",

author = "Chao Wang and Lei Chen and Changhong Lu",

note = "Publisher Copyright: {\textcopyright} 2014, Springer Science+Business Media New York.",

year = "2016",

month = feb,

day = "1",

doi = "10.1007/s10878-014-9795-0",

language = "英语",

volume = "31",

pages = "865--873",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - k-Power domination in block graphs

AU - Wang, Chao

AU - Chen, Lei

AU - Lu, Changhong

PY - 2016/2/1

Y1 - 2016/2/1

N2 - The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating set in graphs. The concept of k-power domination, first introduced by Chang et al. (Discret Appl Math 160:1691–1698, 2012), is a common generalization of domination and power domination. In this paper, we present a linear-time algorithm for k-power domination in block graphs.

AB - The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating set in graphs. The concept of k-power domination, first introduced by Chang et al. (Discret Appl Math 160:1691–1698, 2012), is a common generalization of domination and power domination. In this paper, we present a linear-time algorithm for k-power domination in block graphs.

KW - Block graphs

KW - Domination

KW - Electrical network monitoring

KW - Power domination

UR - https://www.scopus.com/pages/publications/84955715596

U2 - 10.1007/s10878-014-9795-0

DO - 10.1007/s10878-014-9795-0

M3 - 文章

AN - SCOPUS:84955715596

SN - 1382-6905

VL - 31

SP - 865

EP - 873

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 2

ER -

k-Power domination in block graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this