Total domination and least domination in a tree
文献类型：期刊论文
| 作者 | Lv, XZ; Mao, JZ |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2003-04-06 |
| 卷号 | 265期号:1-3页码:401-404 |
| 关键词 | total dominating set least dominating set middle vertex |
| ISSN号 | 0012-365X |
| DOI | 10.1016/S0012-365X(02)00883-X |
| 英文摘要 | 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. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000182146000030 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/18619]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。