| 图的上符号控制数的上界 |
| |
| 引用本文： | 刘惠敏.图的上符号控制数的上界[J].华东交通大学学报,2009,26(4):100-103,128. |
| |
| 作者姓名： | 刘惠敏 |
| |
| 作者单位： | 华北电力大学数理学院,北京,102206 |
| |
| 摘 要： | 令Гs（G）=max{w（f）｜f是图G的极小符号控制函数}是图的上符号控制数上界，根据最小度最大度等参数改进了上符号控制数的上界，是对Favaron在正则图中给出的上符号控制数上界及Wang C．X．和MaoJ．Z．在几乎正则图中给出的上符号控制数上界的一个推广．与Tang Huajun，Chen Yaojun在3]中确立的解相比，结果更为精确。
|
| 关 键 词： | 符号控制函数 上界 上符号控制数 |
Upper Bounds On the Upper Signed Domination Number of Graphs |
| |
| LIU Hui-min.Upper Bounds On the Upper Signed Domination Number of Graphs[J].Journal of East China Jiaotong University,2009,26(4):100-103,128. |
| |
| Authors: | LIU Hui-min |
| |
| Institution: | LIU Hui-min(School of Mathematics and Physics, North China Electric Power University, Beijing 102206, China) |
| |
| Abstract: | The upper signed domination number of a graph G, denoted by Гs（G） ,is defined as Гs（G） = max { w （f） ｜f is a minimal signed dominating function ofG. In this paper, we establish a tight upper bound for Гs（G） in terms of minimum degree and maximum degree. Our resuh is a generalization of those regular graphs and nearly regular graphs obtained in 1 ] and 2 ] respectively. Compared with the conclusion in 3 ], the result in this paper is more precise. |
| |
| Keywords: | signed dominating function upper bound upper signed domination number |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《华东交通大学学报》浏览原始摘要信息 |
| 点击此处可从《华东交通大学学报》下载免费的PDF全文 |
|
