2连通2可断图的性质和结构

THE PROPERTIES AND STRUCTURE OF 2-CONNECTED 2-SEPERABLE GRAPHS

若图G的每个子图H的连通度不超过2,则称图G是2可断图。对2连通2可断图的一些基本性质进行讨论,由此得到2连通2可断图的最大边数,并刻划了极值图的结构。

A graph G is said to be 2 -separable, if every sub graph H of G has connectivity at most 2. This paper discussed about the property of 2 -connected 2 -seperable graph, and obtained the maximum edge numbers of this kind of graph, characterized the extremal graphs which the edge numbers reach the maximum.