Lower bounds on the minus domination and k-subdomination numbers
文献类型：会议论文
| 作者 | Kang, LY ; Qiao, H; Shan, EF; Du, DZ
|
| 出版日期 | 2003 |
| 会议名称 | 7th Annual International Conference on Computing and Combinatorics |
| 会议日期 | AUG 20-23, 2001 |
| 会议地点 | GUILIN, PEOPLES R CHINA |
| 关键词 | domination number minus domination k-subdomination |
| 通讯作者 | Kang, LY |
| 英文摘要 | 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 nu is an element of V, f(N[nu]) greater than or equal to 1, where N[nu] consists of nu and all vertices adjacent to nu. The weight of a minus function is f(V) = Sigma(nuis an element ofV) f(nu). 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 Dunbar et al. (Discrete Math.. 199 (1999) 35), and we give a lower bound on gamma(ks)(G) of a graph G. (C) 2002 Elsevier Science B.V. All rights reserved. |
| 会议录 | THEORETICAL COMPUTER SCIENCE
 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/12843]  |
| 专题 | 自动化研究所_09年以前成果 |
| 推荐引用方式 GB/T 7714 | Kang, LY,Qiao, H,Shan, EF,et al. Lower bounds on the minus domination and k-subdomination numbers[C]. 见:7th Annual International Conference on Computing and Combinatorics. GUILIN, PEOPLES R CHINA. AUG 20-23, 2001. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。