BooleanGraph

BooleanGraph[bfunc,g1,,gn]

gives the Boolean graph defined by the Boolean function bfunc on the graphs g1, , gn.

Details and Options

Examples

open allclose all

Basic Examples  (1)

The Boolean combination of two graphs:

Scope  (5)

BooleanGraph works with undirected graphs:

Directed graphs:

BooleanGraph works with as many graphs as the Boolean function:

Multigraphs:

Mixed graphs:

Applications  (4)

Define the symmetric graph difference Xor:

Convert the Boolean expression Xor to disjunctive normal form:

Implement it by related functions:

Compare to the result by using Xor directly:

Define the graph Nand:

Convert the Boolean expression Nand to disjunctive normal form:

Implement it by related functions:

Compare to the result by using Nand directly:

Define the graph Nor:

Convert the Boolean expression Nor to disjunctive normal form:

Implement it by related functions:

Compare to the result by using Nor directly:

Compute the Boolean graph for all Boolean functions of two variables:

Use BooleanFunction to enumerate all Boolean functions of two variables:

Compute the Boolean graph using these functions:

Properties & Relations  (3)

GraphUnion corresponds to Or:

GraphIntersection corresponds to And:

BooleanGraph does not necessarily produce simple graphs:

Use SimpleGraph if only a simple graph is needed:

Introduced in 2010
 (8.0)
 |
Updated in 2014
 (10.0)