Computations regarding certain graphs associated to finite polar spaces

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.