A note on the signed clique domination numbers of graphs
A note on the signed clique domination numbers of graphs
复制标题
关于图的签名团支配数的注记
DOI：
10.1155/2022/3208164
复制
发表时间：
2022
影响因子：
1.4
通讯作者：
Mengmeng Zheng
中科院分区：
文献类型：
--
作者：
Baogen Xu;Ting Lan;Mengmeng Zheng
设G=(V，E)是一个图。称函数f：E⟶{−1，+1}是G的符号团控制函数，如果∑e∈E(K)f(E)≥1对每个非平凡团KinG成立。G的带符号团支配数定义为γscl‘g=min∑e∈egfe|fis an scdf ofg。本文研究了图的联图的符号团控制数。我们纠正了Ao等人报道的两个错误结果。(2014)和Ao等人。(2015)，并确定了的符号团支配数和Cm∨Kn的精确值。
LetG= (V,E) be a graph. A functionf:E⟶{−1, +1} is said to be a signed clique dominating function (SCDF) ofGif ∑e∈E(K)f(e) ≥ 1 holds for every nontrivial cliqueKinG. The signed clique domination number ofGis defined as γscl′G=min∑e∈EGfe|fis an SCDF ofG. In this paper, we investigate the signed clique domination numbers of join of graphs. We correct two wrong results reported by Ao et al. (2014) and Ao et al. (2015) and determine the exact values of the signed clique domination numbers ofandCm∨Kn.