Modular intersection graphs

A graphG = (V, E) is a modular intersection graph on a finite setU if there is a family of subsetsS = {S_xx V} ofU and positive integerst < m such thatxy is an edge ofG if and only if |S_x S_y| (modm) t. Modular representations of various classes of graphs and studied as well as some related parameters.Research supported by Grant N00014-89-J-1643 from the Office of Naval Research.