On the graphical characterization of the projective space over a finite field (Q1063034): Difference between revisions

Two interesting classes of graphs are studied and characterized. First, the author gives the characterization of graphs constructed from a projective space PG(n,q) in the following way: the vertex set is the set of all lines of the space and two vertices are joined by an edge whenever they correspond to a pair of intersecting lines. And further, he characterizes another class of graphs constructed from a finite projective plane (P,L) as follows: the set of vertices is the union of P and L and two vertices are not joined to each other whenever they correspond to a pair of point and line that are not incident. The main results of the paper are summarized by Theorems A and B, respectively.