邻接树图的连通度

THE CONNECTIVITY OF ADJACENT TREE GRAPHS

设Ｇ是任一连通图，Ｈ是Ｇ的邻接树图，κ（Ｈ），λ（Ｈ），δ（Ｈ）分别是Ｈ的连通度，边连通度和最小次，则κ（Ｈ）＝λ（Ｈ）＝δ（Ｈ）．

おァ et G be a connected graph and H be the adjacent tree graph of G.Let k(H),λ(H)and δ(G)denote the connectivity,edgeconnectivity and minimum degree of H,respectively.Then κ(H)=λ(H)=δ(H) is obtained.