lambda '-optimally connected mixed Cayley graphs

作者：Tian Yingzhi; Meng Jixiang^*

来源：Applied Mathematics Letters, 2011, 24(6): 872-877.

DOI：10.1016/j.aml.2010.12.037

• Restricted edge connectivity
• lambda '-optimal
• Mixed Cayley graph
• Combinatorial problems

A restricted edge cut of a graph X is an edge set whose removal disconnects X into nontrivial components. The cardinality of the minimum restricted edge cut is the restricted edge connectivity, denoted by lambda '(X). If X has restricted edge cuts and lambda '(X) achieves the upper bound of the restricted edge connectivity, X is said to be lambda'-optimal. In this work, we will prove that for all but a few exceptions, the mixed Cayley graph is lambda'-optimal.

• 出版日期2011-6
• 单位新疆大学