Learn More
A (k, g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of searches for cages. We present the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions.
We present a new construction of infinite families of (finite as well as infinite) vertex-transitive graphs that are not Cayley graphs; many of these turn out even to be arc-transitive. The construction based on representing vertex-transitive graphs as coset graphs of groups, and on a simple but powerful necessary arithmetic condition for Cayley graphs.(More)
The main topic of the paper is the question of the existence of self-complementary Cayley graphs Cay(G; S) with the property S 6 = G # n S for all 2 Aut(G). We answer this question in the positive by constructing an innnite family of self-complementary circulants with this property. Moreover, we obtain a complete classiication of primes p for which there(More)