Let Gbe a connected k(≥3)-regulargraph w ith girth g. A setSofthe edgesin G is called an R2-edge-cutifG- Sis disconnected and contains neither an isolated vertex nor a one- degree vertex. The R2-edge-connectivity of ...Let Gbe a connected k(≥3)-regulargraph w ith girth g. A setSofthe edgesin G is called an R2-edge-cutifG- Sis disconnected and contains neither an isolated vertex nor a one- degree vertex. The R2-edge-connectivity of G, denoted by λ″(G), is the m inim um cardinality over allR2-edge-cuts, w hich is an im portantm easure for fault-tolerance of com puter intercon- nection netw orks. In this paper, λ″(G)= g(2k- 2) for any 2k-regular connected graph G(≠ K5) that is either edge-transitive or vertex-transitive and g≥5 is given.展开更多
文摘Let Gbe a connected k(≥3)-regulargraph w ith girth g. A setSofthe edgesin G is called an R2-edge-cutifG- Sis disconnected and contains neither an isolated vertex nor a one- degree vertex. The R2-edge-connectivity of G, denoted by λ″(G), is the m inim um cardinality over allR2-edge-cuts, w hich is an im portantm easure for fault-tolerance of com puter intercon- nection netw orks. In this paper, λ″(G)= g(2k- 2) for any 2k-regular connected graph G(≠ K5) that is either edge-transitive or vertex-transitive and g≥5 is given.