# Accession Number:

## AD0724783

# Title:

## Similarity Transformations on Boolean Matrices,

# Descriptive Note:

# Corporate Author:

## NATIONAL BIOMEDICAL RESEARCH FOUNDATION SILVER SPRING MD

# Personal Author(s):

# Report Date:

## 1965-01-01

# Pagination or Media Count:

## 12.0

# Abstract:

Diagrams of nodal structures can look very different to the eye but may still represent equivalent connections when the nodes themselves are indistinguishable. Such situations arise in many areas such as logical circuit diagrams and chemical structures. The purpose of this paper is to present a determinist method for deciding whether or not two model structures are equivalent. The technique used is to observe that the connections between nodes can be indicated as a Boolean matrix. In this sense the columns of the matrix are labeled by the nodes, and the rows of the matrix are labeled by the nodes a unit indicates that the corresponding row and column nodes are connected, a zero indicates that they are not. Given two such connection matrices, the problem reduces to that of determining whether or not a permutation exists such that if the rows and columns of one matrix are permuted, the result will be the other matrix. Author

# Descriptors:

# Subject Categories:

- Theoretical Mathematics