GraphIntersection
GraphIntersection[g1,g2]
gives the graph intersection of the graphs g1 and g2.
GraphIntersection[g1,g2,…]
gives the graph intersection of g1, g2, … .
GraphIntersection[{vw,…},…]
uses rules vw to specify the graph g.
Details and Options
- The graph intersection Graph[v1,e1]⋂Graph[v2,e2] is given by Graph[v1⋃v2,e1⋂e2].
- GraphIntersection works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examples
open allclose allScope (5)
GraphIntersection works with undirected graphs:
Properties & Relations (8)
The vertices of the graph intersection are the union of the vertices of the graphs:
The edges of the graph intersection are the intersection of the edges of the graphs:
The graph intersection of any graph and itself is isomorphic to the original graph:
The graph intersection of a graph and its subgraph has the same edges as its subgraph:
The intersection of any graph and its complement is an empty graph:
The intersection of two graphs with different names is an empty graph:
The GraphIntersection of two graphs has the same vertices as GraphUnion:
The GraphIntersection of two graphs has the same vertices as GraphDifference:
Text
Wolfram Research (2010), GraphIntersection, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphIntersection.html (updated 2015).
CMS
Wolfram Language. 2010. "GraphIntersection." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/GraphIntersection.html.
APA
Wolfram Language. (2010). GraphIntersection. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/GraphIntersection.html