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

线图及复合图的边完整度
引用本文:李峰伟,叶青芳.线图及复合图的边完整度[J].五邑大学学报(自然科学版),2003,17(2):26-29.
作者姓名:李峰伟  叶青芳
作者单位:1. 五邑大学,数学物理系,广东,江门,529020
2. 西安电子科技大学,应用数学系,陕西,西安,710071
摘    要:图G的边完整度定义为I'(G)=minS包含E{|S| m(G-S)},被用来衡量网络特别是通讯网络的脆弱度,它刻画了破坏网络的难易程度和网络遭受破坏的程度.论文主要给出了线图、复合图的边完整度及图的边完整度和其线图的完整度之间的关系.

关 键 词:线图  复合图  边完整度  完整度  通讯网络  图论  连通度
文章编号:1006-7302(2003)02-0026-04
修稿时间:2002年12月6日

On the Edge-Integrity of Line Graphs and Composite Graphs
LI Feng-wei,YE Qing-fang.On the Edge-Integrity of Line Graphs and Composite Graphs[J].Journal of Wuyi University(Natural Science Edition),2003,17(2):26-29.
Authors:LI Feng-wei  YE Qing-fang
Abstract:The edge-integrity of a graph G is defined as I'(G) = min{|S | +m(G-S)}, where m(G-S) denotes the order of the maximum component of graph G-S. This parameter can be used to measure the vulnerability of a network, especially a communication network; it shows not only the difficulty to break down the network but also the damage that has been caused . In this paper, we not only give the edge-integrity of line graphs and composite graphs but also give the relationship between the edge-integrity of a graph and the integrity of its line-graph.
Keywords:edge-integrity  integrity  line graph  composite graph
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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