Graphs from Zero-One Matrices

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.

A zero-one matrix has entries that are either zero or one. Such matrices are often used to encode a relation between two sets of objects; a one at means the object is related to the object and a zero means they are not. For an undirected graph, a one at means that vertex is joined to vertex .

Contributed by: George Beck (September 2008)
Open content licensed under CC BY-NC-SA



For undirected graphs it is sufficient to consider lower-triangular matrices, though the matrix is usually taken to be symmetric.

Self-loops would be indicated by ones on the main diagonal, but such entries are not allowed here.

Directed edges and multiple edges are not considered here. Directed edges correspond to matrices that are not symmetric.

Multiple edges would be indicated by positive integer entries.

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.