On the isoperimetric number of a kk-degree Cayley graph

In this work, we shall concentrate on the isoperimetric properties of the kk-degree Cayley graphs Gk,nGk,n, which were proposed recently for building interconnection networks. We shall give the exact isoperimetric number i(Gk,n)i(Gk,n) when n=2n=2, and an upper bound of i(Gk,n)i(Gk,n) in the general case.