| 几类图的独立约束数及独立加强数 |
| |
| 引用本文： | 张静华,刘海龙,孙良.几类图的独立约束数及独立加强数[J].北京理工大学学报,2003,23(2):140-142. |
| |
| 作者姓名： | 张静华 刘海龙 孙良 |
| |
| 作者单位： | 北京理工大学,理学院数学系,北京,100081 |
| |
| 摘 要： | 利用归纳假设方法及图的独立数的一些定理，研究几类图——路、完全二分图、圈、树中的独立约束数及独立加强数．求出路、圈的独立约束数和独立加强数及完全二分图的独立约束数，并给出树独立加强数的界．
|
| 关 键 词： | 独立数 独立约束数 独立加强数 |
| 文章编号： | 1001-0645(2003)02-0140-03 |
| 收稿时间： | 2002/5/29 0:00:00 |
| 修稿时间： | 2002年5月29日 |
Independence Bondage Number and Reinforcement Number of Some Graphs |
| |
| ZHANG Jing hu,LIU Hai long and SUN Liang.Independence Bondage Number and Reinforcement Number of Some Graphs[J].Journal of Beijing Institute of Technology(Natural Science Edition),2003,23(2):140-142. |
| |
| Authors: | ZHANG Jing hu LIU Hai long and SUN Liang |
| |
| Institution: | Department of Mathematics, School of Science, Beijing Institute of Technology, Beijing100081, China;Department of Mathematics, School of Science, Beijing Institute of Technology, Beijing100081, China;Department of Mathematics, School of Science, Beijing Institute of Technology, Beijing100081, China |
| |
| Abstract: | To study the independence bondage number and independence reinforcement number of some graphs such as paths, complete bipartite graphs, cycles and trees, Induction method and some theorems of independence number were used. Independence bondage number and independence reinforcement number of paths and cycles and independence bondage number of complete bipartite graphs have been obtained and an upper bound for independence reinforcement number of trees is given. |
| |
| Keywords: | independence number independence bondage number independence reinforcement number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
|
