| 关于图的符号团控制数 |
| |
| 引用本文： | 徐保根,兰婷,张君霞,李广. 关于图的符号团控制数[J]. 江西师范大学学报(自然科学版), 2021, 45(4): 331-334+338. DOI: 10.16357/j.cnki.issn1000-5862.2021.04.01 |
| |
| 作者姓名： | 徐保根 兰婷 张君霞 李广 |
| |
| 作者单位： | 华东交通大学理学院,江西 南昌 330013 |
| |
| 基金项目： | 国家自然科学基金;国家自然科学基金;江西省自然科学基金;江西省自然科学基金 |
| |
| 摘 要： | 对于一个非空图G=(V,E)和一个函数f:E→{-1,+1},若SE,则记f(S)=∑e∈Sf(e).若对于G中每个非平凡的团K均满足f(E(K))≥1,则f被称为G的一个符号团控制函数,G的符号团控制数表达为
|
| 关 键 词： | 图 联图 控制数 符号团控制数 |
On Signed Clique Domination Numbers of Graphs |
| |
| XU Baogen,LAN Ting,ZHANG Junxia,LI Guang. On Signed Clique Domination Numbers of Graphs[J]. Journal of Jiangxi Normal University (Natural Sciences Edition), 2021, 45(4): 331-334+338. DOI: 10.16357/j.cnki.issn1000-5862.2021.04.01 |
| |
| Authors: | XU Baogen LAN Ting ZHANG Junxia LI Guang |
| |
| Affiliation: | Department of Mathematics,East China Jiaotong University,Nanchang Jiangxi 330013,China |
| |
| Abstract: | For a nonempty graph G=(V,E)and a function f:E→{-1,+1},if SE then write f(S)=∑e∈Sf(e),a function f is said to be a signed clique dominating function(SCDF)of the graph G if f(E(K))≥1 holds for every nontrivial clique K in G,and the signed clique domination number of G is defined as γ'scl(G)=min{f(E)| f is SCDF of G}.In this paper,the signed clique domination numbers of some join graph are studied,and the signed clique domination numbers of graphs Cm∨K^-n,Cm∨nK2 and Cm∨Cn are mainly determined,which generalize partially some known results. |
| |
| Keywords: | Graph join graph domination number signed clique domination number |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《江西师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《江西师范大学学报(自然科学版)》下载全文 |
|
