Truth Graph: A Novel Method for Minimizing Boolean Algebra Expressions by Using Graphs

Boolean algebra expressions are used by stakeholders from a range of disciplines, such as engineers, to build logic circuits. To reduce the cost and transaction numbers of logic circuits, engineers minimize Boolean expressions by reducing the number of terms or arithmetic operations. A well-known pictorial method applied for minimizing Boolean expressions is the Karnaugh map. However, a drawback is that these maps are not effective for minimizing Boolean expressions involving more than four variables. We introduce a novel method for minimizing Boolean expressions by using graphs, which we call a “Truth Graph” that can be effectively applied when many variables exist.