 |
BUILT-IN MATHEMATICA SYMBOL
BooleanGraph
BooleanGraph[bfunc, g1, ..., gn]
gives the Boolean graph defined by the Boolean function bfunc on the graphs 
, ..., 
.
Details and Options
- The Boolean graph has a vertex list given by the union of vertex lists.
- An edge
is in the resulting graph if bfunc[EdgeQ[g1, u
v], ..., EdgeQ[gn, uv]] is True. - An edge
is in the resulting graph if bfunc[EdgeQ[gi, u
v], ..., EdgeQ[gn, uv]] is True. - GraphUnion[g1, g2] is equivalent to BooleanGraph[Or, g1, g2].
- GraphIntersection[g1, g2] is equivalent to BooleanGraph[And, g1, g2].
- GraphDifference[g1, g2] is equivalent to BooleanGraph[#1
¬#2&, g1, g2].
New in 8
