相关论文: Constructions of Strongly Regular Cayley Graphs an…

We prove the existence of directed strongly regular graphs with parameters (60,21,11,6,8), (60,22,12,8,8), (60,24,10,9,10), (60,25,17,8,12), (60,27,21,12,12) and (60,28,20,14,12). The group $S_5 \times 2$ acts transitively on the…

There are exactly 35 inequivalent (36, 15, 6) difference sets in nine groups. Eight of the nine groups have a normal Sylow 3-subgroup. We give a straightforward spread construction which explains the 32 inequivalent difference sets in these…

In this paper we investigate the structure of the critical groups of doubly regular tournaments (DRTs) associated with skew Hadamard difference families (SDFs) with one, two, or four blocks. Brown and Reid found the existence of a skew…

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…

We give a new construction of difference families generalizing Szekeres's difference families \cite{Sze}. As an immediate consequence, we obtain some new examples of difference families with several blocks in multiplicative subgroups of…

The concept of directed strongly regular graphs was introduced by Duval in his paper, A Directed Graph Version of Strongly Regular Graphs. Duval also provided several construction methods for directed strongly regular graphs. The directed…

Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar…

In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…

We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…

We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least $3$ over a finite field of order $q$. We show that these graphs are non-isomorphic to the…

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials…

We construct an infinite family of triples (G,S1, S2) each consisting of a group G and a pair (S1, S2) of distinct subsets of G with the following properties. i The two Cayley graphs Cay(G, S1) and Cay(G,S2) are non-isomorphic. ii The…

We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…

Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design…

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…

We study bipartite distance-regular Cayley graphs with diameter three or four. We give sufficient conditions under which a bipartite Cayley graph can be constructed on the semidirect product of a group -- the part of this bipartite Cayley…

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q^3$ is constructed. It is proved that these…