we investigate edge-toughness of some regular graphs.It is proved that
for a noncomplete connected r-regular graph with r=κ'(G)
its edge-toughness approximately equalsr2(1+1|V(G)|-1).And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.
关键词
Keywords
references
Bondy J A,Murty U S R.Graph Theory with Applications[M].New York:Macmillan,London Elsevi-er,1976.
Gusfield D Connectivity and edge disjoint spanning trees[J].Inform Process Lett,16,1983:87-89.
Nash-Williams C St J A.Edge-disjoint spanning trees of finite graphs[J].J London Math Soc,1961,36:445-450.
Tutte W T.On the problem of decomposing a graph into n connected factors[J].J London Math Soc,1961,36:221-230.