Finding a Smooth Frame Decomposition of a Graph  

图的光滑支架分解(英文)

作　　者：李德明[1] 郝荣霞[2] 

机构地区：[1]首都师范大学数学系,北京100037 [2]北方交通大学数学系,北京100044

出　　处：《Chinese Quarterly Journal of Mathematics》2001年第3期75-79,共5页数学季刊（英文版）

摘　　要：Let G be a graph and A be a subset of the edges of G. A frame decomposition of G is a pair (G-A,A) such t ha t G-A is connected. A smooth frame decomposition of G is a frame decompo sition satisfying the two conditions: (1) Every leaf of G-A has a connected cotree and (2) The set of bridges of G-B(G-A) is A, where B(G-A) is the set of bridges of G-A. An efficient algorithm on finding a smooth frame decompositi on of a graph is provided.

关 键 词：smooth frame decomposition algorthm BRIDGE spanning tree 

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