Displaying 381 – 400 of 1398

Showing per page

Families of strongly projective graphs

Benoit Larose (2002)

Discussiones Mathematicae Graph Theory

We give several characterisations of strongly projective graphs which generalise in many respects odd cycles and complete graphs [7]. We prove that all known families of projective graphs contain only strongly projective graphs, including complete graphs, odd cycles, Kneser graphs and non-bipartite distance-transitive graphs of diameter d ≥ 3.

Currently displaying 381 – 400 of 1398