TY - JOUR
T1 - Upper bounds for the k-subdomination number of graphs
AU - Kng, Li-Ying
AU - Dang, Chuangyin
AU - Cai, Mao-Heng
AU - Shn, Erfng
PY - 2002/3/28
Y1 - 2002/3/28
N2 - For a positive integer k, a A-subdominating function of G = (lr,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 / and the minimum aggregate among all Ar-subdominating functions of G is the t-subdomination number yt,(G). In this paper, we solve a conjecture proposed in (Ars. Combin 43 (1996) 235), which determines a sharp upper bound on yks(G) for trees if k > \V\/2 and give an upper bound on y is for connected graphs. © 2002 Elsevier Science B.V. All rights reserved.
AB - For a positive integer k, a A-subdominating function of G = (lr,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 / and the minimum aggregate among all Ar-subdominating functions of G is the t-subdomination number yt,(G). In this paper, we solve a conjecture proposed in (Ars. Combin 43 (1996) 235), which determines a sharp upper bound on yks(G) for trees if k > \V\/2 and give an upper bound on y is for connected graphs. © 2002 Elsevier Science B.V. All rights reserved.
KW - A'-subdomination number
KW - Graph
KW - Open and closed neighborhoods
KW - Tree
UR - http://www.scopus.com/inward/record.url?scp=31244431990&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-31244431990&origin=recordpage
U2 - 10.1016/s0012-365x(01)00311-9
DO - 10.1016/s0012-365x(01)00311-9
M3 - RGC 21 - Publication in refereed journal
SN - 0012-365X
VL - 247
SP - 229
EP - 234
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -