Total domination and least domination in a tree

doi:10.1016/S0012-365X(02)00883-X

CSpace

	Total domination and least domination in a tree
	Lv, XZ ; Mao, JZ
	2003-04-06
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	265 期号:1-3 页码:401-404
摘要	The total domination number gamma(t) of a graph G = (V, E) is the minimum cardinality of a dominating set D of G such that every vertex of V has at least one neighbor in D. The least domination number gamma(L) of G is the minimum cardinality of a dominating set X of G whose domination number is the minimum. In this paper, we prove the following conjecture due to Odile Favaron: Conjecture. For any tree T, we have gamma(L)(T)/gamma(t)(T) less than or equal to 3/2. (C) 2003 Elsevier Science B.V. All rights reserved.
关键词	total dominating set least dominating set middle vertex
DOI	10.1016/S0012-365X(02)00883-X
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000182146000030
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/18620
专题	中国科学院数学与系统科学研究院
通讯作者	Lv, XZ
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China 2.Cent China Normal Univ, Dept Math, Wuhan 430079, Peoples R China
推荐引用方式 GB/T 7714	Lv, XZ,Mao, JZ. Total domination and least domination in a tree[J]. DISCRETE MATHEMATICS,2003,265(1-3):401-404.
APA	Lv, XZ,&Mao, JZ.(2003).Total domination and least domination in a tree.DISCRETE MATHEMATICS,265(1-3),401-404.
MLA	Lv, XZ,et al."Total domination and least domination in a tree".DISCRETE MATHEMATICS 265.1-3(2003):401-404.