Power domination in regular claw-free graphs

Changhong Lu; Rui Mao; Bing Wang

doi:10.1016/j.dam.2020.03.055

Power domination in regular claw-free graphs

Changhong Lu
, Rui Mao^*
, Bing Wang

^*此作品的通讯作者

数学科学学院

Shanghai Lixin University of Accounting and Finance
Chuzhou University

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

6 引用（Scopus）

摘要

In this paper, we show that the power domination number of a connected 4-regular claw-free graph on n vertices is at most [Formula presented], and the bound is sharp. The statement disproves the conjecture presented by Dorbec et al. (2013).

源语言	英语
页（从-至）	401-415
页数	15
期刊	Discrete Applied Mathematics
卷	284
DOI	https://doi.org/10.1016/j.dam.2020.03.055
出版状态	已出版 - 30 9月 2020

访问文件

10.1016/j.dam.2020.03.055

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{cf270662bf7f4acf8948147fccabc7d5,

title = "Power domination in regular claw-free graphs",

abstract = "In this paper, we show that the power domination number of a connected 4-regular claw-free graph on n vertices is at most [Formula presented], and the bound is sharp. The statement disproves the conjecture presented by Dorbec et al. (2013).",

keywords = "Claw-free graph, Power domination, Regular",

author = "Changhong Lu and Rui Mao and Bing Wang",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = sep,

day = "30",

doi = "10.1016/j.dam.2020.03.055",

language = "英语",

volume = "284",

pages = "401--415",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Power domination in regular claw-free graphs

AU - Lu, Changhong

AU - Mao, Rui

AU - Wang, Bing

PY - 2020/9/30

Y1 - 2020/9/30

N2 - In this paper, we show that the power domination number of a connected 4-regular claw-free graph on n vertices is at most [Formula presented], and the bound is sharp. The statement disproves the conjecture presented by Dorbec et al. (2013).

AB - In this paper, we show that the power domination number of a connected 4-regular claw-free graph on n vertices is at most [Formula presented], and the bound is sharp. The statement disproves the conjecture presented by Dorbec et al. (2013).

KW - Claw-free graph

KW - Power domination

KW - Regular

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

U2 - 10.1016/j.dam.2020.03.055

DO - 10.1016/j.dam.2020.03.055

M3 - 文章

AN - SCOPUS:85083179106

SN - 0166-218X

VL - 284

SP - 401

EP - 415

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Power domination in regular claw-free graphs

摘要

访问文件

其它文件与链接

指纹

引用此