Elsevier, European Journal of Combinatorics, 3(32), p. 352-360, 2011
DOI: 10.1016/j.ejc.2010.10.012
Full text: Download
In this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also several structural conditions are given for a connected k-regular bi-abelian graph to have edge connectivity strictly less than k. Finally, two infinite families of partial sum families that generate directed strongly regular graphs with new parameters are shown.