Lower bounds on the minus domination and k-subdomination numbers
文献类型：期刊论文
| 作者 | Kang, LY; Qiao, H; Shan, EF; Du, DZ |
| 刊名 | COMPUTING AND COMBINATORICS
 |
| 出版日期 | 2001 |
| 卷号 | 2108页码:375-383 |
| ISSN号 | 0302-9743 |
| 英文摘要 | A three-valued function f defined on the vertex set of a graph G = (V, E), f : V --> {1, 0, 1} is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every upsilon is an element of V, f (N[upsilon]) greater than or equal to 1, where N[upsilon] consists of upsilon and all vertices adjacent to upsilon. The weight of a minus function is f(V) = Sigma(upsilonis an element ofV) f(upsilon). The minus domination number of a graph G, denoted by gamma(-) (G), equals the minimum weight of a minus dominating function of G. In this paper, sharp lower bounds on minus domination of a bipartite graph are given. Thus, we prove a conjecture proposed by J. Dunbar etc.(Discrete Math. 199(1999) 35-47), and we give a lower bound on gamma(ks) (G) of a graph G. |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000179960000041 |
| 出版者 | SPRINGER-VERLAG BERLIN |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/16884]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Kang, LY |
| 作者单位 | 1.Shanghai Univ, Dept Math, Shanghai 200436, Peoples R China 2.City Univ Hong Kong, Dept Mfg Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China 3.Shijiazhuang Normal Coll, Dept Math, Shijiazhuang 050041, Peoples R China 4.Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA 5.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Kang, LY,Qiao, H,Shan, EF,et al. Lower bounds on the minus domination and k-subdomination numbers[J]. COMPUTING AND COMBINATORICS,2001,2108:375-383. |
| APA | Kang, LY,Qiao, H,Shan, EF,&Du, DZ.(2001).Lower bounds on the minus domination and k-subdomination numbers.COMPUTING AND COMBINATORICS,2108,375-383. |
| MLA | Kang, LY,et al."Lower bounds on the minus domination and k-subdomination numbers".COMPUTING AND COMBINATORICS 2108(2001):375-383. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。