A Note on the Signed Clique Domination Numbers of Graphs

Baogen Xu, Ting Lan, Mengmeng Zheng and Serkan Araci

Journal of Mathematics, 2022, vol. 2022, 1-6

Abstract: Let G=V,E be a graph. A function f:E⟶−1,+1 is said to be a signed clique dominating function (SCDF) of G if ∑e∈EKfe≥1 holds for every nontrivial clique K in G. The signed clique domination number of G is 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 of Pm∨Kn¯ and Cm∨Kn.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/3208164.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/3208164.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3208164

DOI: 10.1155/2022/3208164

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().