相关论文: Construction of directed strongly regular graphs w…

In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

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…

In this paper, we aim to address the open questions raised in various recent papers regarding characterization of circulant graphs with three or four distinct eigenvalues in their spectra. Our focus is on providing characterizations and…

In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…

A graph has strong convex dimension $2$, if it admits a straight-line drawing in the plane such that its vertices are in convex position and the midpoints of its edges are also in convex position. Halman, Onn, and Rothblum conjectured that…

An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

One must add arrows which are forced by transitivity to form the transitive closure of a directed graph. We introduce a construction of a transitive directed graph which is formed by adding vertices instead of arrows and which preserves the…

We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial…

We provide an abundance of strongly regular graphs (SRGs) for certain parameters $(n, k, \lambda, \mu)$ with $n < 100$. For this we use Godsil-McKay (GM) switching with a partition of type $4,n-4$ and Wang-Qiu-Hu (WQH) switching with a…

Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…

We give simple arithmetic conditions that force the Sylow $p$-subgroup of the critical group of a strongly regular graph to take a specific form. These conditions depend only on the parameters $(v, k, \lambda, \mu)$ of the strongly regular…

We give two constructions of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 2 Gauss sums. In particular, we obtain twelve infinite families of strongly regular graphs with new…

We establish the existence of simple designs with parameters $2$-$(55,10,4)$, $3$-$(20,5,4)$, $3$-$(21,7,30)$, $4$-$(15,5,2)$, $4$-$(16,8,45)$, $5$-$(16,7,10)$, and $5$-$(17,8,40)$, which have previously been unknown. For the corresponding…

Two methods, structural (constructive) and multiplier (analytical), of exact enumeration of undirected and directed circulant graphs of orders 27 and 125 are elaborated and represented in detail here together with intermediate and final…

We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…

We study the point regular groups of automorphisms of some of the known generalised quadrangles. In particular we determine all point regular groups of automorphisms of the thick classical generalised quadrangles. We also construct point…