首页 | 本学科首页   官方微博 | 高级检索  
     检索      

孤立断裂度给定条件下的一类图
引用本文:鄯洁,王世英.孤立断裂度给定条件下的一类图[J].太原师范学院学报(自然科学版),2012,11(2):20-24.
作者姓名:鄯洁  王世英
作者单位:山西大学数学科学学院,山西太原,030006
基金项目:国家自然科学基金资助项目
摘    要:连通图G的孤立断裂度isc(G)=max{i(G-S)-|S|:S∈C(G)},其中C(G)是G的点割集,i(G-S)是G-S中的孤立点数.文章给出了顶点数和孤立断裂度为定值的具有最大边数和最小边数的连通图.

关 键 词:网络  断裂度  孤立断裂度  可靠性

A Class of Graphs with Given Isolated Scattering Number
Shan Jie Wang Shiying.A Class of Graphs with Given Isolated Scattering Number[J].Journal of Taiyuan Normal University:Natural Science Edition,2012,11(2):20-24.
Authors:Shan Jie Wang Shiying
Institution:Shan Jie Wang Shiying(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)
Abstract:The isolated scattering numbers isc(G)=max{i(G-S)-|S|:S∈C(G)},where G is a connected graph,C(G) is the set of vertex cuts of G and i(G-S) is the number of isolated vertices of G-S.The maximum and minimum number of edges of connected graphs with given numbers of vertices and the isolated scattering numbers are investigated,and the construction of the corresponding graphs is given.
Keywords:networks  scattering number  isolated scattering number  vnlnerability
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号