网络结构的边毁裂度  

The edge rupture degree of network structure

作　　者：刘二强[1] 李银奎[1] 

机构地区：[1]青海民族大学数学与统计学院,青海西宁810007

出　　处：《纯粹数学与应用数学》2014年第4期428-434,共7页Pure and Applied Mathematics

基　　金：教育部"信息网络抗毁性与嵌入式理论研究"(Z2010007);青海民族大学"基于抗毁性的网络结构优化研究"(xjz201403)

摘　　要：在毁裂度的基础上,研究图的边的毁裂度.通过优化组合、归纳假设的方法界定了图的边毁裂度的值,如笛卡尔积图:Pm×Pn,Pm×Cn,Cm×Cn,Km×Kn,并界定了G=G1×G2的边毁裂度的界.最后给出了一些基本图,如路、圈、星图、完全二部图Km,n的线图边毁裂度.This paper is based on the rupture degree, and researches the edge rupture degree of graphs. By methods of optimized combination, inductive hypothesis,define the edge rupture degree of graphs.Such as the Cartesian product graphs ：Pm × Pn, Pm × Cn, Cm × Cn, Km× Kn,and define the bound of edge rupture degree of G = G1 × G2. At last, discussed the rupture degree of line graph of some graph classes, such as paths, circle, star graph, complete bipartite graph K and so on.

关 键 词：边毁裂度 笛卡尔积图 线图 

分 类 号：O157.5[理学—数学]