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^*

^*此作品的通讯作者

数学科学学院

East China Normal University
Shanghai Maritime University

科研成果: 期刊稿件 › 文章 › 同行评审

19 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	865-873
页数	9
期刊	Journal of Combinatorial Optimization
卷	31
期	2
DOI	https://doi.org/10.1007/s10878-014-9795-0
出版状态	已出版 - 1 2月 2016

访问文件

10.1007/s10878-014-9795-0

其它文件与链接

链接到 Scopus 的出版物

引用此

@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

摘要

访问文件

其它文件与链接

指纹

引用此