CASIA OpenIR  > 09年以前成果
Lower bounds on the minus domination and k-subdomination numbers
Kang, LY; Qiao, H; Shan, EF; Du, DZ
Conference Name7th Annual International Conference on Computing and Combinatorics
Conference DateAUG 20-23, 2001
AbstractA 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.
KeywordDomination Number Minus Domination K-subdomination
Document Type会议论文
Corresponding AuthorKang, LY
Recommended Citation
GB/T 7714
Kang, LY,Qiao, H,Shan, EF,et al. Lower bounds on the minus domination and k-subdomination numbers[C],2003.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Kang, LY]'s Articles
[Qiao, H]'s Articles
[Shan, EF]'s Articles
Baidu academic
Similar articles in Baidu academic
[Kang, LY]'s Articles
[Qiao, H]'s Articles
[Shan, EF]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Kang, LY]'s Articles
[Qiao, H]'s Articles
[Shan, EF]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.