Home → Magazine Archive → January 1964 (Vol. 7, No. 1) → A note on multiplying boolean matrices II → Abstract

A note on multiplying boolean matrices II

By D. R. Comstock

Communications of the ACM, Vol. 7 No. 1, Page 13

In a note by Baker [1], a method is given for getting the limiting connectivity matrix, B, of a matrix whose entries are Boolean 0's and 1's. Harary [2] suggests determining An-1 since An-1 = An = ··· , where n is the order of the matrix. The purpose of this note is to give a method for determining An-1. The method is also applicable to finding the output matrix of a switching network as described in [3] and [4] where again An-1 = An = ··· , but A now has Boolean switching functions as entries instead of 0's and 1's.

The full text of this article is premium content


No entries found