On the isoperimetric number of a -degree Cayley graph

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