Published in

Elsevier, European Journal of Combinatorics, 3(32), p. 352-360, 2011

DOI: 10.1016/j.ejc.2010.10.012

Links

Tools

Export citation

Search in Google Scholar

Edge connectivity in difference graphs and some new constructions of partial sum families

Journal article published in 2011 by Alexander Araluze, Klavdija Kutnar, Luis Martínez, Dragan Marusic
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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.