K-Subdomination in graphs

研究成果: 雜誌貢獻期刊論文同行評審

7 引文 斯高帕斯(Scopus)

摘要

For a positive integer k, a k-subdominating function of a graph G=(V,E) is a function f: V→{-1,1} such that ∑u∈N G[v]f(u)1 for at least k vertices v of G. The k-subdomination number of G, denoted by γ ks(G), is the minimum of ∑ v∈Vf(v) taken over all k-subdominating functions f of G. In this article, we prove a conjecture for k-subdomination on trees proposed by Cockayne and Mynhardt. We also give a lower bound for γ ks(G) in terms of the degree sequence of G. This generalizes some known results on the k-subdomination number γ ks(G), the signed domination number γ s(G) and the majority domination number γ maj(G).

原文???core.languages.en_GB???
頁(從 - 到)55-60
頁數6
期刊Discrete Applied Mathematics
120
發行號1-3
DOIs
出版狀態已出版 - 15 8月 2002

指紋

深入研究「K-Subdomination in graphs」主題。共同形成了獨特的指紋。

引用此