On (0,2)-graphs and semibiplanes
Muskovin, Jennifer Anne
MetadataShow full item record
A semibiplane is a connected point-block incidence structure such that any two points are in either 0 or 2 common blocks and any two blocks have either 0 or 2 common neighbors. A (0,2)-graph is a connected graph such that any pair of vertices has either 0 or 2 common neighbors. The incidence graph of a semibiplane is a bipartite (0,2)-graph. In this paper we construct (0,2)-graphs from known graphs by taking Cartesian products, quotients and adding matchings and construct semibiplanes by taking quotients of finite projective planes.