|
|||||
|
|
| 图与补图孤立断裂度的关系 | |
| 引用本文： | 王世英,王牟江山,冯凯,林上为,张明瑜.图与补图孤立断裂度的关系[J].山西大学学报(自然科学版),2012,35(2):206-210. |
| 作者姓名： | 王世英 王牟江山 冯凯 林上为 张明瑜 |
| 作者单位： | 1. 山西大学数学科学学院,山西太原,030006 2. 中国科学院研究生院,北京,100049 3. 山西大学计算机与信息技术学院,山西太原,030006 |
| 基金项目： | 国家自然科学基金，教育部博士点基金(博导类) |
| 摘 要： | 连通图G的孤立断裂度isc(G)=max{i(G-S)-｜ S ｜:S∈C(G)},其中i(G-S)是G-S中的孤立点数,C(G)是G的点割集.文章研究了图与补图孤立断裂度的关系. |
| 关 键 词： | 网络 可靠性 孤立断裂度 |
Relation of the Isolated Scatting Number of a Graph and Its Complement Graph |
|
| WANG Shi-ying , WANGMU Jiang-shan , FENG Kai , LIN Shang-wei , ZHANG Ming-yu.Relation of the Isolated Scatting Number of a Graph and Its Complement Graph[J].Journal of Shanxi University (Natural Science Edition),2012,35(2):206-210. | |
| Authors: | WANG Shi-ying WANGMU Jiang-shan FENG Kai LIN Shang-wei ZHANG Ming-yu |
| Institution: | 1(1.School of Mathematical Science,Shanxi University,Taiyuan 030006,China; 2.Graduate University of Chinese Academy of Sciences,Beijing 100049,China; 3.School of Computer Science and Technology,Shanxi University,Taiyuan 030006,China) |
| Abstract: | The isolated scattering number isc(G)=max{i(G-S)-|S|:S∈C(G)},where G is a connected graph,i(G-S) is the number of isolated vertices of G-S and C(G) is the set of vertex cuts of G.In this paper,we investigate the relation of the isolated scatting number of a graph and its complement graph. |
| Keywords: | networks vulnerability isolated scattering number |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |