Modular product of graphs

From Wikipedia, the free encyclopedia

This article does not cite any references or sources. (October 2007)
Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed.

The modular product of graphs.

In graph theory, the modular product of graphs G and H is a graph such that

the vertex set of the modular product of G and H is the cartesian product V(G) × V(H); and
any two vertices (u, v) and (u' , v' ) are adjacent in the modular product of G and H if and only if either
- u is adjacent with u' and v is adjacent with v' , or
- u is not adjacent with u' and v is not adjacent with v' .