The Edge-Connectivity of 2n-Regular Simple Graph

Sheng Ji-ming · Shuxue de shijian yu renshi · 2010

All kind of conceptions on connectivity of graph have been used to study the reliability problem of networks.Let 2m be an even number in .We construct a 2n-regular simple graph such that the value of it′s edge-connectivity is 2m.It shows that the edge-connectivity of 2n-regular simple graph can be any even number of {0,2,4,…,2n}.

Read the paper · More papers on PaperTik