Properties of the interval graph of a Boolean function

Main Article Content

L. Haviarová E. Toman

Abstract

In the present paper we describe relations between the interval graph of a Boolean function, its abbreviated disjunctive normal form and its minimal disjunctive normal forms. The inteval graph of a Boolean function f has vertices corresponding to the maximal intervals of f and any two vertices are joined with an edge if the corresponding maximal intervals have nonempty intersection.

Article Details

How to Cite
Haviarová, L., & Toman, E. (2017). Properties of the interval graph of a Boolean function. Acta Mathematica Universitatis Comenianae, 82(2), 191-200. Retrieved from http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/739/494
Section
Articles