| 关于图的符号圈(点)控制 |
| |
| 引用本文： | 徐保根,丁宗鹏,汤友亮.关于图的符号圈(点)控制[J].河南教育学院学报(自然科学版),2011(4):1-3. |
| |
| 作者姓名： | 徐保根 丁宗鹏 汤友亮 |
| |
| 作者单位： | 华东交通大学基础科学学院 |
| |
| 基金项目： | 国家自然科学基金(11061014);江西省教育厅科研项目(GJJ09215) |
| |
| 摘 要： | 引入了图的符号圈(点)控制概念,给出了所有n阶极大平面图G(n≥3)的符号圈(点)控制数γsc(G)的一个下界,即γsc(G)≥(8n - 16 - n△)/△,并且此下界是最好可能的,获得了满足γsc(G)=∣V( G)∣ -2的所有连通图的一个特点.此外,还确定了几类特珠图的符号圈(点)控制数.
|
| 关 键 词： | 图 平面图 函数:符号圈(点)控制函数 符号圈(点)控制数 |
On Signed Cycle(Vertex) Domination in Graphs |
| |
| XU Bao-gen,DING Zong-peng,TANG You-liang.On Signed Cycle(Vertex) Domination in Graphs[J].Journal of Henan Education Institute(Natural Science Edition),2011(4):1-3. |
| |
| Authors: | XU Bao-gen DING Zong-peng TANG You-liang |
| |
| Institution: | (School of Basic Sciences,East China Jiaotong University,Nanchang 330013,China) |
| |
| Abstract: | Introduce the concept of signed cycle(vertex) domination in graphs,and give a lower bound for signed cycle(vertex) domination number γsc(G)of every maximal planar graph G of order n≥3,γscG≥(8n-16-nΔ)/Δ,and show that this lower bound is the best possible,and gain a feature for all connected graphs of γscG=VG-2.In addition,get the signed cycle(vertex) domination number for some special classes of graphs. |
| |
| Keywords: | graph planar graph function signed cycle(vertex) domination function signed cycle(vertex) domination number |
| 本文献已被 CNKI 等数据库收录！ |
