A Survey on Strongly Regular Graphs with $m_2 = qm_3$' and $m_3 = qm_2$

We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is strongly regular if there exist non-negative integers τ and ???? such that |Si ∩Sj| = τ for any two adjacent vertices i and j, and |Si ∩Sj| = ???? for any two distinct non-adjacent vertices i and j, where Sk denotes the neighborhood of the vertex k. Let λ1 = r, λ2 and λ3 be the distinct eigenvalues of a connected strongly regular graph. Let m1 = 1, m2 and m3 denote the multiplicity of r, λ2 and λ3, respectively. We here survey results related to the parameters n, r, τ and ???? for strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 2,3,…,12.

Authors

Institutions

Publication Details

Journal
Kragujevac Journal of Mathematics
Published
2026-11-16
DOI
https://doi.org/10.46793/kgjmat2609.1513l
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Survey on Strongly Regular Graphs with $m_2 = qm_3$' and $m_3 = qm_2$

Mirko Lepović
Kragujevac Journal of Mathematics
Finite Group Theory Research
article

A Survey on Strongly Regular Graphs with $m_2 = qm_3$' and $m_3 = qm_2$

Mirko Lepović
article en

Abstract

We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is strongly regular if there exist non-negative integers τ and ???? such that |Si ∩Sj| = τ for any two adjacent vertices i and j, and |Si ∩Sj| = ???? for any two distinct non-adjacent vertices i and j, where Sk denotes the neighborhood of the vertex k. Let λ1 = r, λ2 and λ3 be the distinct eigenvalues of a connected strongly regular graph. Let m1 = 1, m2 and m3 denote the multiplicity of r, λ2 and λ3, respectively. We here survey results related to the parameters n, r, τ and ???? for strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 2,3,…,12.

Kragujevac Journal of MathematicsVol. 50(9)
University of Kragujevac (RS)
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon