Boolean Operations on Graphs

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Boolean operations include the use of the logic operators AND, OR, and NOT applied to a number of arguments. There are Boolean functions on arguments. The state-of-the-art Boolean computation in Mathematica 8 makes it possible to apply arbitrary Boolean operations over graphs. This Demonstration shows the formula and result for each of the sixteen Boolean functions on two arguments operating on the complete graph on five vertices and the complete graph on three vertices. The counterparts of the operations AND, OR, and NOT for graphs are called union, intersection, and difference. The union of two graphs is obtained as the graph resulting from the union of their vertices and the union of their edges; the other operations are defined similarly.

Contributed by: Jaime Rangel-Mondragon (August 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.