中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Upper minus domination in regular graphs

文献类型:期刊论文

作者Kang, L; Cai, M
刊名DISCRETE MATHEMATICS
出版日期2000-05-28
卷号219期号:1-3页码:135-144
关键词r-regular graph minus domination signed domination
ISSN号0012-365X
英文摘要A three-valued function f defined on the vertices 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 v E V, f(N[v])greater than or equal to 1, where N[v] consists of v and every vertex adjacent to v. The weight of a minus dominating function is f(V)= Sigma(v is an element of V) f(v). The upper minus domination number of a graph G, denoted Gamma(-)(G), equals the maximum weight of a minimal minus dominating function of G. In this paper, sharp upper bounds on Gamma(-) of regular graphs are found. Thus, we answer an open problem proposed by Henning and Slater (Discrete Math. 158 (1996) 87-98). (C) 2000 Published by Elsevier Science B.V. All rights reserved.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000087401000012
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/15249]  
专题中国科学院数学与系统科学研究院
通讯作者Kang, L
作者单位1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
2.Shijiazhuang Railway Inst, Dept Basic Course, Shijiazhuang 050043, Peoples R China
推荐引用方式
GB/T 7714
Kang, L,Cai, M. Upper minus domination in regular graphs[J]. DISCRETE MATHEMATICS,2000,219(1-3):135-144.
APA Kang, L,&Cai, M.(2000).Upper minus domination in regular graphs.DISCRETE MATHEMATICS,219(1-3),135-144.
MLA Kang, L,et al."Upper minus domination in regular graphs".DISCRETE MATHEMATICS 219.1-3(2000):135-144.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。