| 关于图的距离Irredundance数 |
| |
| 引用本文： | 单而芳,闫柏玲,康丽英. 关于图的距离Irredundance数[J]. 军械工程学院学报, 1997, 0(1) |
| |
| 作者姓名： | 单而芳 闫柏玲 康丽英 |
| |
| 作者单位： | 石家庄师范专科学校数学系，石家庄铁路运输学校数学组，石家庄铁道学院基础科学部 石家庄 050041，石家庄 050003，石家庄 050043 |
| |
| 摘 要： | G=(V,E)是简单连通图,用G—v表示从G中删除v以及与v相关联的边所得到的图,ir_n(G)表示G的n—irredundance数,证明了下列不等式: ir_n(G—v)≥(ir_n(G) 1)/2这个结果推广了Favaron的相应结论。
|
| 关 键 词： | 图 n-domination数 n-irredundant集 n-irredundance数 |
ON THE DISTANCE IRREDUNDANCE NUMBER OF A GRAPH |
| |
| Shan Erfang Yan Boling Kang Liying. ON THE DISTANCE IRREDUNDANCE NUMBER OF A GRAPH[J]. Journal of Ordnance Engineering College, 1997, 0(1) |
| |
| Authors: | Shan Erfang Yan Boling Kang Liying |
| |
| Abstract: | Let G = (V,E) be a simple and connected graph, G-v denotes the subgraph of G obtained by deleting the vertex v and all edges incident with v, irn(G) denotes n ?irredundance number of G. In this paper, the following imequality is proved.The results extend the conclusion of Favaron . |
| |
| Keywords: | Graph n - Domination number n - Irredundant set n - Irredundance number |
| 本文献已被 CNKI 等数据库收录！ |
