λ(G)≤δ(G).A graph G is said to be maximally edge-connected if λ(G)=δ(G).A graph G is said to be super edge-connected if for every minimum edge cut T of G
G-T has isolated vertices.In this paper
we prove that for all but a few exceptions
the G~++- is super edge-connected where G~++-is transformation graph of a graph G introduced in [1].
关键词
Keywords
references
B a llM O.Com p lex ity of netw ork re liab ility com pu tation[J].N etw orks,1980,10:153-165.
Boesch F T.O n unre liab lility po lynom ia ls and graph connectiv ity in re liab le netw ork syn thes is[J].J G raphT heory,1986,10:339-352.
Bondy J A,M urty U S R.G raph T heory and A pp lications[M].N ew Y ork:A cadem ic press,1976.
W u baoy in,M eng jix iang.B as ic P roperties of T ransform ation G raphs[J].JM ath S tudy,2001,34(2):109-116.
B auer D,T inde ll R.T he connecctiv ities of line and tata l graphs[J].Journa l of G raph T heory,1982,6(2):197-203.
京公网安备11010802024621