A Note on the Signed Clique Domination Numbers of Graphs
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 do...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/3208164 |