Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique

DOI10.1007/S10623-023-01348-9MaRDI QIDQ6440263zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Vladislav Kabanov

Publication date 14 June 2023

Full work available at URL https://doi.org/10.1007/s10623-023-01348-9

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) General block designs in finite geometry (51E05)

Abstract: In 2022, the second author found a prolific construction of strongly regular graphs, which is based on joining a coclique and a divisible design graph with certain parameters. The construction produces strongly regular graphs with the same parameters as the complement of the symplectic graph $mathsfSp(2d,q)$. In this paper, we determine the parameters of strongly regular graphs which admit a decomposition into a divisible design graph and a coclique attaining the Hoffman bound. In particular, it is shown that when the least eigenvalue of such a strongly regular graph is a prime power, its parameters coincide with those of the complement of $mathsfSp(2d,q)$. Furthermore, a generalization of the construction is discussed.

Recommendations

• A new construction of strongly regular graphs with parameters of the complement symplectic graph
• Star complementary strongly regular decompositions of strongly regular graphs
• Strongly regular graphs with strongly regular decomposition
• On strongly regular designs admitting fusion to strongly regular decomposition
• scientific article; zbMATH DE number 1817540

Cited in

(6)

• On strongly regular designs admitting fusion to strongly regular decomposition
• Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal
• Construction of divisible design graphs using affine designs
• Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
• Divisible design graphs from the symplectic graph
• Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3

This page was built for publication: Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440263)