The Strongly Regular (40, 12, 2, 4) Graphs
نویسنده
چکیده
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-investigated these graphs and have now been able to determine them all, and so complete the classification. We have discovered that there are precisely 28 non-isomorphic (40, 12, 2, 4) strongly regular graphs. The one that was not found in the previous investigation is characterised uniquely by the fact that every neighbour graph is triangle-free.
منابع مشابه
The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t)
The values t = 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a generalised quadrangle of order (3, t). This gives the following possible parameter sets for strongly regular graphs that are pseudo-geometric for such a generalised quadrangle: (v, k, λ, μ) = (16, 6, 2, 2), (40, 12, 2, 4), (64, 18, 2, 6), (76, 31, 2, 7) and (112, 30, 2, 10). It is well-known that there ar...
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملStrongly regular Cayley graphs over primary abelian groups of rank 2
Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [5] and [12]. It was shown that such graphs exist iff the corresponding group is isomorphic to Zpn ⊕Zpn , where p is an odd prime. In this paper we classify all strongly regular Cayley graphs over this group using Schur rings method. As a consequence we obtain a complete classification of strongly...
متن کاملConstruction of Directed Strongly Regular Graphs Using Finite Incidence Structures
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters (l(q−1)q, l(q−1)q, (lq−l+1)q, (l−1)(q−1)q, (lq−l+1)q) for integers q and l (q, l ≥ 2), and (lq(q − 1), lq(q − 1), lq − l + 1, (l − 1)(q − 1), lq − l + 1) for all prime powers q and l ∈ {1, 2, . . . , q}. The new graphs given by these constructions include those with parameter...
متن کاملTRANSITIVE t - DESIGNS AND STRONGLY REGULAR GRAPHS CONSTRUCTED FROM LINEAR GROUPS L ( 2 , q ) , q ≤ 23
In this paper we construct transitive t-designs from the linear groups L(2, q), q ≤ 23. Thereby we classify t-designs, t ≥ 2, admitting a transitive action of the linear groups L(2, q), q ≤ 23, up to 35 points and obtained numerous transitive designs, for 36 ≤ v ≤ 55. In many cases we proved the existence of t-designs with certain parameter sets. Among others we constructed t-designs with param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 7 شماره
صفحات -
تاریخ انتشار 2000