Graph Intersection
Let 
be a set and 
a nonempty family of distinct nonempty subsets of 
whose union is
. The intersection
graph of 
is denoted 
and defined
by 
, with 
and 
adjacent whenever
and 
.
Then a graph 
is an intersection
graph on 
if there exists a family 
of subsets for
which 
and 
are isomorphic graphs (Harary 1994, p. 19). Graph
intersections can be computed in the Wolfram
Language using GraphIntersection[g,
h].
Contact the MathWorld Team
aleph2
