Title of article :
Super Edge Connectivity Properties of Connected Edge Symmetric Graphs
Author/Authors :
Li، Qiaoliang نويسنده , , Li، Qiao نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Abstract :
The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity (landa) (G). We evaluate (landa) (G) and the number of i-cutsets Ci(G), d <= i <= 2d - 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same subject. © 1999 John Wiley & Sons, Inc. Networks 33: 157-159, 1999
Keywords :
telecommunications network , distributed computing systems , integer programming , dual ascent
