Graph Intersection
المؤلف:
Harary, F.
المصدر:
Graph Theory. Reading, MA: Addison-Wesley, 1994
الجزء والصفحة:
...
10-4-2022
2479
Graph Intersection
Let 
be a set and ![F=<span style=]()
{S_1,...,S_p}" src="https://mathworld.wolfram.com/images/equations/GraphIntersection/Inline2.svg" style="height:25px; width:124px" /> 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].
REFERENCES
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.
Skiena, S. "Unions and Intersections." §4.1.1 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 129-131, 1990.
الاكثر قراءة في نظرية البيان
اخر الاخبار
اخبار العتبة العباسية المقدسة
