Computations regarding certain graphs associated to finite polar spaces

2021/05/26 by Antonio Pasini, Pasini, Antonio
Computer Science · Mathematics · #51E24 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2105.12616

openalex publication_date 2021/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this conjecture under the hypothesis that the considered rank are not too small.

Related

• A Switching for all Strongly Regular Collinearity Graphs From Polar\n Spaces
• A new characterization of the dual polar graphs
• The minimum rank problem over finite fields
• On Geometry and Combinatorics of Finite Classical Polar Spaces
• Regular sets of lines in rank 3 polar spaces