Tightness of the Weight‐Distribution Bound for Strongly Regular Polar Graphs

ABSTRACT In this paper, we show the tightness of the weight‐distribution bound for the positive nonprincipal eigenvalue of strongly regular (affine) polar graphs and characterise the optimal eigenfunctions. Additionally, we show the tightness of the weight‐distribution bound for the negative nonprincipal eigenvalue of some unitary polar graphs.

Authors

Institutions

Publication Details

Journal
Journal of Combinatorial Designs
Published
2025-08-04
DOI
https://doi.org/10.1002/jcd.22001
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
article

Tightness of the Weight‐Distribution Bound for Strongly Regular Polar Graphs

Rhys J. Evans, Sergey Goryainov, Leonid Shalaginov
Journal of Combinatorial Designs
Finite Group Theory Research
article

Tightness of the Weight‐Distribution Bound for Strongly Regular Polar Graphs

Rhys J. Evans, Sergey Goryainov, Leonid Shalaginov
article en

Abstract

ABSTRACT In this paper, we show the tightness of the weight‐distribution bound for the positive nonprincipal eigenvalue of strongly regular (affine) polar graphs and characterise the optimal eigenfunctions. Additionally, we show the tightness of the weight‐distribution bound for the negative nonprincipal eigenvalue of some unitary polar graphs.

Journal of Combinatorial DesignsVol. 33(12)
Chelyabinsk State University (RU), Institute of Mathematics, Physics, and Mechanics (SI), Hebei Normal University (CN)
Openalex Percentile: Top 74%
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.