Switching equivalence of strongly regular polar graphs

We prove the switching equivalence of the strongly regular polar graphs <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:msup> <mml:mi>O</mml:mi> <mml:mo>±</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>4</mml:mn> <mml:mi>m</mml:mi> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> , <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:msup> <mml:mi>O</mml:mi> <mml:mo>∓</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>2</mml:mn> <mml:mi>m</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> , and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Γ</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mi>O</mml:mi> <mml:mo>∓</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>4</mml:mn> <mml:mi>m</mml:mi> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> with an isolated vertex by giving an analytic description for them and their associated two-graphs.

Authors

Institutions

Publication Details

Journal
Algebraic Combinatorics
Published
2026-03-03
DOI
https://doi.org/10.5802/alco.470
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Switching equivalence of strongly regular polar graphs

Gábor P. Nagy, Valentino Smaldore
Algebraic Combinatorics
Finite Group Theory Research
article

Switching equivalence of strongly regular polar graphs

Gábor P. Nagy, Valentino Smaldore
article en

Abstract

We prove the switching equivalence of the strongly regular polar graphs <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:msup> <mml:mi>O</mml:mi> <mml:mo>±</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>4</mml:mn> <mml:mi>m</mml:mi> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> , <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:msup> <mml:mi>O</mml:mi> <mml:mo>∓</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>2</mml:mn> <mml:mi>m</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> , and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Γ</mml:mi> <mml:mo>(</mml:mo> <mml:msup> <mml:mi>O</mml:mi> <mml:mo>∓</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mn>4</mml:mn> <mml:mi>m</mml:mi> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> with an isolated vertex by giving an analytic description for them and their associated two-graphs.

Algebraic CombinatoricsVol. 9(1)
University of Szeged (HU), Gestione Sistemi per l’Informatica (Italy) (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", Hungarian Scientific Research Fund, Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni, Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
Openalex Percentile: Top 35%
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.