| 关于图的n-Irredundance数和n-Domination数 |
| |
| 引用本文： | 康丽英,张立红.关于图的n-Irredundance数和n-Domination数[J].军械工程学院学报,1995(3). |
| |
| 作者姓名： | 康丽英 张立红 |
| |
| 作者单位： | 石家庄铁道学院基础部，军械工程学院数学教研室 石家庄 050043，石家庄 050003 |
| |
| 摘 要： | 设G是简单连通图,r_n~c(G)和ir_n(G)分别表示图G的连通n-Domination数和n-Irredundance数、本文证明了如下结论:r_n~c(G)≤(3n+1)ir_n(G)-2n。
|
| 关 键 词： | 图 连通n-Domination数 n-Irredundanoe数 |
ON THE n-IRREDUNDANCE NUMBER AND n-DOMINATION NUMBER IN GRAPHS |
| |
| Kang Liying.ON THE n-IRREDUNDANCE NUMBER AND n-DOMINATION NUMBER IN GRAPHS[J].Journal of Ordnance Engineering College,1995(3). |
| |
| Authors: | Kang Liying |
| |
| Institution: | Kang Liying (Shijiazhuang Railway Insdtute)Zhang Lihong (Ordnance Engineering College) |
| |
| Abstract: | Let G be a simple and connected graph, rnc(G) and irn(G) denote connected n -Domination number and n - Irredundance number, respectively. In this paper, the following result is proved: |
| |
| Keywords: | graph connected n-Domination number n- Irredundance number |
| 本文献已被 CNKI 等数据库收录！ |
