-optimally connected mixed Cayley graphs
✍
Yingzhi Tian; Jixiang Meng
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 252 KB
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 λ ′ (X). If X has restricted edge cuts and λ ′ (X) achieves the upper bound of the restricted e