Domination in distance-hereditary graphs

Maw Shang Chang; Shaur Ching Wu; Gerard J. Chang; Hong Gwa Yeh

doi:10.1016/S0166-218X(00)00330-9

Domination in distance-hereditary graphs

Maw Shang Chang, Shaur Ching Wu, Gerard J. Chang, Hong Gwa Yeh

數學系

研究成果: 雜誌貢獻 › 期刊論文 › 同行評審

17 引文斯高帕斯（Scopus）

摘要

The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case.

原文	???core.languages.en_GB???
頁（從 - 到）	103-113
頁數	11
期刊	Discrete Applied Mathematics
卷	116
發行號	1-2
DOIs	https://doi.org/10.1016/S0166-218X(00)00330-9
出版狀態	已出版 - 15 1月 2002

存取文件

10.1016/S0166-218X(00)00330-9

引用此

@article{675cafe7b25147d9beaafbc7b340f9ae,

title = "Domination in distance-hereditary graphs",

abstract = "The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case.",

keywords = "Distance-hereditary graph, Domination, Labeling, Leaf, Neighborhood, Twin",

author = "Chang, {Maw Shang} and Wu, {Shaur Ching} and Chang, {Gerard J.} and Yeh, {Hong Gwa}",

note = "Funding Information: Supported partly by the National Science Council under grants NSC85-2121-M194-020 and NSC85-2121-M009-024. ",

year = "2002",

month = jan,

day = "15",

doi = "10.1016/S0166-218X(00)00330-9",

language = "???core.languages.en_GB???",

volume = "116",

pages = "103--113",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

number = "1-2",

}

TY - JOUR

T1 - Domination in distance-hereditary graphs

AU - Chang, Maw Shang

AU - Wu, Shaur Ching

AU - Chang, Gerard J.

AU - Yeh, Hong Gwa

N1 - Funding Information: Supported partly by the National Science Council under grants NSC85-2121-M194-020 and NSC85-2121-M009-024.

PY - 2002/1/15

Y1 - 2002/1/15

N2 - The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case.

AB - The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case.

KW - Distance-hereditary graph

KW - Domination

KW - Labeling

KW - Leaf

KW - Neighborhood

KW - Twin

UR - http://www.scopus.com/inward/record.url?scp=84867956253&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(00)00330-9

DO - 10.1016/S0166-218X(00)00330-9

M3 - 期刊論文

AN - SCOPUS:84867956253

SN - 0166-218X

VL - 116

SP - 103

EP - 113

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -

Domination in distance-hereditary graphs

摘要

存取文件

指紋

引用此