On intriguing sets in five classes of strongly regular graphs

TL;DR

This paper constructs intriguing sets within five classes of strongly regular graphs derived from finite classical polar spaces and determines their intersection numbers, advancing understanding of these combinatorial structures.

Contribution

It introduces new intriguing sets in five classes of strongly regular graphs from finite classical polar spaces and calculates their intersection numbers.

Findings

Constructed intriguing sets in five classes of strongly regular graphs.

Determined intersection numbers for these intriguing sets.

Enhanced understanding of combinatorial properties of graphs from polar spaces.

Abstract

In this paper, we construct intriguing sets in five classes of strongly regular graphs defined on nonisotropic points of finite classical polar spaces, and determine their intersection numbers.