On restricted edge-connectivity of half-transitive multigraphs

Yingzhi Tian, Jixiang Meng, Xing Chen

Let $G=(V,E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $\lambda (G)$, is the cardinality of a minimum edge-cut of $G$. We call $G$ maximall…