一类正则图的边坚韧度(英文)

Edge-Tougness of Some Regular Graphs

证明了一类r-正则r=κ′(G)连通非完全图G的边坚韧度近似等于r/2(1+(1/│V(G)│-1))并且提供了估计一些特殊图类的笛卡儿积和Kronecker积的边坚韧度的公式.关键词:边坚韧度;笛卡儿积;

In this paper, we investigate edge-toughness of some regular graphs. It is proved that, for a noncomplete connected r-regular graph with r = k＇ （G） , its edge-toughness approximately equals r/2（1＋1/│V（G）-1│）.And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.