Related papers: A construction of small (q-1)-regular graphs of gi…
We present simple, geometric constructions for small regular graphs of girth 7 from the incidence graphs of some generalized quadrangles. We obtain infinite families of (q-1)-regular, q-regular and (q + 1)-regular graphs of girth 7, for q a…
Let $q$ be a prime power; $(q+1,8)$-cages have been constructed as incidence graphs of a non-degenerate quadric surface in projective 4-space $P(4, q)$. The first contribution of this paper is a construction of these graphs in an…
Let $q\ge 2$ be a prime power. In this note we present a formulation for obtaining the known $(q+1,8)$-cages which has allowed us to construct small $(k,g)$--graphs for $k=q-1, q$ and $g=7,8$. Furthermore, we also obtain smaller…
The first known families of cages arised from the incidence graphs of generalized polygons of order $q$, $q$ a prime power. In particular, $(q+1,6)$--cages have been obtained from the projective planes of order $q$. Morever, infinite…
In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic…
Let $k\ge 1$ be an odd integer, $t=\lfloor {{k+2}\over 4}\rfloor$, and $q$ be a prime power. We construct a bipartite, $q$-regular, edge-transitive graph $C\!D(k,q)$ of order $v \le 2q^{k-t+1}$ and girth $g \ge k+5$. If $e$ is the the…
For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators…
An edge-girth-regular graph $egr(v,k,g,\lambda)$, is a $k$-regular graph of order $v$, girth $g$ and with the property that each of its edges is contained in exactly $\lambda$ distinct $g$-cycles. An $egr(v,k,g,\lambda)$ is called extremal…
We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$. We also show…
We construct an infinite family of (q+1)-regular Ramanujan graphs X_n of girth 1. We also give covering maps X_{n+1} --> X_n such that the minimal common covering of all the graphs is the universal covering tree.
A $[z,r;g]$-mixed cage is a mixed graph of minimum order such that each vertex has $z$ in-arcs, $z$ out-arcs, $r$ edges, and it has girth $g$, and the minimum order for $[z,r;g]$-mixed graphs is denoted by $n[z,r;g]$. In this paper, we…
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters \[(l(q-1)q^l,\ l(q-1)q^{l-1},\ (lq-l+1)q^{l-2},\ (l-1)(q-1)q^{l-2},\ (lq-l+1)q^{l-2})\] for integers $q$ and $l$ ($q,…
Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…
We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG$(n,q)$, $n\ge 5$ odd, and show that the members of the family are the smallest possible examples if $n\ge 9$ or $q\ge 25$.
For any odd prime power q we provide a quick construction of a complete family of q(q-1) mutually orthogonal sudoku squares of order q^2.
Let $q = p^e$, where $p$ is a prime and $e$ is a positive integer. The family of graphs $D(k, q)$, defined for any positive integer $k$ and prime power $q$, were introduced by Lazebnik and Ustimenko in 1995. To this day, the connected…
In the projective planes $\mathrm{PG}(2,q)$, we collect the smallest known sizes of complete arcs for the regions \begin{align*} &\mbox{all } q\le160001,~~ q \mbox{ prime power};\\ &Q_{4}=\{34 \mbox{ sporadic }q'\mbox{s in the interval…
The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{A\Gamma L}}(1,q)$ whenever $q$ is sufficiently…
A graph $G$ is hypohamiltonian if $G$ is non-hamiltonian and $G - v$ is hamiltonian for every $v \in V(G)$. In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave a list of all graphs of order at…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…