Upper bounds for the k-subdomination number of graphs

CSpace

	Upper bounds for the k-subdomination number of graphs
	Kang, LY ; Dang, CY ; Cai, MC ; Shan, EF
	2002-03-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	247 期号:1-3 页码:229-234
摘要	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.
关键词	graph tree open and closed neighborhoods k-subdomination number
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000174911400018
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17265
专题	中国科学院数学与系统科学研究院
通讯作者	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.