Contents

-

Connectivity of Bi-Cayley Graphs

Xiaodong Liang1, Jixiang Meng1
1College of Mathematics and System Sciences, Xinjiang University Urumgi, Xinjiang 830046, People’s Republic of China

Abstract

Let G be a finite group and S be a subset (possibly containing the identity element) of G. We define the Bi-Cayley graph X=BC(G,S) to be the bipartite graph with vertices G×{0,1} and edges {(g,0),(sg,1):gG,sS}. In this paper, we show that if X=BC(G,S) is connected, then κ(X)=δ(X).