Related papers: There is no (95,40,12,20) strongly regular graph
We show that there is no (75,32,10,16) strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough induced structure and apply the star complement technique. Our…
In this paper we show that there does not exist a strongly regular graph with parameters $(1911,270,105,27)$.
We prove the non-existence of strongly regular graph with parameters $(76,30,8,14)$. We use Euclidean representation of a strongly regular graph together with a new lower bound on the number of 4-cliques to derive strong structural…
We prove that there is no strongly regular graph (SRG) with parameters (460,153,32,60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs.
We present a new non-existence proof for the strongly regular graph $G$ with parameters $(76,21,2,7)$, using the unit vector representation of the graph.
We investigate the second smallest unresolved feasible set of parameters of strongly regular graphs, $(v,k,\lambda,\mu)=(85,14,3,2)$. Using the classification of cubic graphs of small degree, we restrict possible local structure of such a…
A graph is {\it square-complementary} ({\it squco}, for short) if its square and complement are isomorphic. We prove that there is no squco graph of girth $6$, thus answersing a question asked by Milani\vc et al. [Discrete Math., 2014, to…
We determine that there is no partial geometry ${\cal G}$ with parameters $(s,t,\alpha)=(4,27,2)$. The existence of such a geometry has been a challenging open problem of interest to researchers for almost 40 years. The particular interest…
We prove that a distance-regular graph with intersection array {56,36,9;1,3,48} does not exist. This intersection array is from the table of feasible parameters for distance-regular graphs in "Distance-regular graphs"\ by A.E. Brouwer, A.M.…
Maximum size of equiangular lines in $\mathbb{R}^{19}$ has been known in the range between 72 to 76 since 1973. Acoording to the nonexistence of strongly regular graph $(75,32,10,16)$ \cite{aza15}, Larmen-Rogers-Seidel Theorem \cite{lar77}…
In this paper we will show that there does not exist a distance-regular graph $\Gamma$ with intersection array $\{80, 54,12; 1, 6, 60\}$. We first show that a local graph $\Delta$ of $\Gamma$ does not contain a coclique with 5 vertices, and…
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…
A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs…
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…
We prove that a distance-regular graph with intersection array $\{55,36,11;1,4,45\}$ does not exist. This intersection array is from the table of feasible parameters for distance-regular graphs in "Distance-regular graphs"\ by A.E. Brouwer,…
Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs that arise from 2-weight codes. One of these new graphs is…
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…
This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…
We contribute results on $r$-regular graphs that do and don't have the maximum possible toughness, namely $r/2$. Doty and Ferland showed the existence of a $5$-regular graph with toughness $5/2$ for all even orders except $n= 18$. Using a…
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley…