λ′-optimal regular graphs with two orbits

作者：Lin, Huiqiu; Yang, Weihua; Meng, Jixiang^*

来源：Ars Combinatoria, 2015, 121: 175-185.

• Orbit
• Atom
• Restricted edge connectivity

An edge set F is called a restricted edge-cut if G-F is disconnected and contains no isolated vertices. The minimum cardinality over all restricted edge-cuts is called restricted edge-connectivity of G, and denoted by lambda'(G). A graph G is called lambda'-optimal if lambda'(G) = zeta

• 出版日期2015-7
• 单位厦门大学; 新疆大学