| 摘要: |
| 本文研究了图的强符号圈控制数γ'ssc(G).利用最大独立集最大匹配等方法,刻画了满足γ'ssc(G)=|E|-2的所有连通图,给出了γ'ssc(G)的一个下界,求出了两类特殊图的强符号圈控制数. |
| 关键词: 强符号圈控制函数 强符号圈控制数 完全k部图 |
| DOI： |
| 分类号:O157.5 |
| 基金项目:山东潍坊市科技局资助项目(20121102). |
|
| ON STRONG SIGNED CYCLE DOMINATION IN GRAPHS |
|
ZHOU Zhong-wang, MA Zhen-jun
|
|
College of Mathematics and Informatics, Weifang University, Weifang 261061, China
|
| Abstract: |
| In this paper, we study the strong signed cycle domination number γ'ssc(G) of graph G. By using maximum independent set, maximum matching etc., we characterize all connected graphs G with γ'ssc(G)=|E(G)|-2, and obtain a lower bound on γ'ssc(G). Finally we give the exact value of γ'ssc(G) for two special classes of graphs. |
| Key words: strong signed cycle dominating function strong signed cycle domination number complete k-partite graph |
