Super edge-connectivity of mixed Cayley graph |
| |
| Authors: | Jinyang Chen Jixiang Meng |
| |
| Institution: | a College of Mathematics and Econometrics, Hunan University, Changsha, 410082, People’s Republic of China
b College of Mathematics and System Sciences, Xinjiang University, Urumqi, 830046, People’s Republic of China |
| |
| Abstract: | A graph X is max-λ if λ(X)=δ(X). A graph X is super-λ if X is max-λ and every minimum edge-cut set of X isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is max-λ and super-λ. |
| |
| Keywords: | Maximal edge-connectivity Super edge-connectivity Mixed Cayley graphs |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
