基于无向图的角联独立不相交通路法  

Independent & disjoin path method of diagonal branches in undirected graph

作　　者：司俊鸿[1] 陈开岩[1] 

机构地区：[1]中国矿业大学安全工程学院,江苏徐州221008

出　　处：《煤炭学报》2010年第3期429-433,共5页Journal of China Coal Society

摘　　要：引入独立不相交通路的概念,即风流方向稳定且一致的通路,由虚拟分支顶点度数和通过虚拟分支顶点的通路分支数确定。针对无向复杂联图,提出了寻找角联结构的独立不相交通路法,得出角联为贯通两条独立不相交通路的通路分支的并集。在此基础上,提出了角联分级的递归定义方法:将通风网络中首次寻找到的角联子网称为1级角联结构,若其中嵌套又一角联子网时,称该子网为二级角联结构,依次类推,直到角联子网为角联分支。通过实例验证了该方法可以快速、完整地找出通风网络中的角联结构。The concept of independent disjoin path（IDP）,which had be stable and the same wind direction,was identified by the vertex degree as well as branch numbers of each path joined the vertex of virtual branch.In order to identify diagonal structure,the IDP method was put forward for complex connection in undirected graph.It is conclude that diagonal branch is a union of branches of a path connecting two IDPs.On this basis,the grading method of diagonal branches was recursively defined：the primary diagonal structure is the diagonal subnet found in ventilation network for the first time,and its nesting subnet is the secondary diagonal structure if it exists,and the rest may be deduced by analogy until the subnet is diagonal branch.It is shown through the application that the method can identify diagonal structure quickly,accurately and completely.

关 键 词：无向图 角联 独立不相交通路 通风网络 

分 类 号：TD725[矿业工程—矿井通风与安全]