Upper bounds for the k-subdomination number of graphs
文献类型：期刊论文
| 作者 | Kang, LY; Dang, CY; Cai, MC; Shan, EF |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2002-03-28 |
| 卷号 | 247期号:1-3页码:229-234 |
| 关键词 | graph tree open and closed neighborhoods k-subdomination number |
| ISSN号 | 0012-365X |
| 英文摘要 | For a positive integer k, a k-subdominating function of G = (V, E) is a Function f : V --> (-1,1) such that the sum of the function values, taken over closed neighborhoods of vertices, is at least one for at least k vertices of G. The sum of the function values taken over all vertices is called the aggregate of f and the minimum aggregate among all k-subdominating functions of G is the k-subdomination number gamma(ks)(G). In this paper, we solve a conjecture proposed in (Ars. Combin 43 (1996) 235), which determines a sharp upper bound on gamma(ks)(G) for trees if k > \V\/2 and give an upper bound on gamma(ks) for connected graphs. (C) 2002 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000174911400018 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/17264]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Cai, MC |
| 作者单位 | 1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.Shanghai Univ, Dept Math, Shanghai 200436, Peoples R China 3.City Univ, Dept Mfg Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China |
| 推荐引用方式 GB/T 7714 | Kang, LY,Dang, CY,Cai, MC,et al. Upper bounds for the k-subdomination number of graphs[J]. DISCRETE MATHEMATICS,2002,247(1-3):229-234. |
| APA | Kang, LY,Dang, CY,Cai, MC,&Shan, EF.(2002).Upper bounds for the k-subdomination number of graphs.DISCRETE MATHEMATICS,247(1-3),229-234. |
| MLA | Kang, LY,et al."Upper bounds for the k-subdomination number of graphs".DISCRETE MATHEMATICS 247.1-3(2002):229-234. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。