Constructing a Class of Symmetric Graphs
โ
Sanming Zhou
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 208 KB
We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe