Independent & disjoin path method of diagonal branches in undirected graph
SI Jun-hong
CHEN Kai-yan
Abstract：The concept of independent & disjoin path(IDP) ,which had be stable and the same wind direction,was identiffed 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.
Keywords：undirected graphdiagonal branchesindependent and disjoin pathventilation network
Publication Date：2010-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 429-433 )