Wolfram Research

Mathematica MathWorld Wolfram Science More »

HOME

Graphs from Zero-One Matrices


	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 ; a zero means they are not. For an undirected graph, a one at means that vertex is joined to vertex .


	Contributed by: George Beck

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

Self-loops are indicated by ones on the main diagonal, but such entries are ignored 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 integer entries.

Graph (Wolfram MathWorld)

(0, 1)-Matrix (Wolfram MathWorld)

Adjacency Matrix (Wolfram MathWorld)

"Graphs from Zero-One Matrices" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/GraphsFromZeroOneMatrices/

Contributed by: George Beck

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

Wolfram Research

Site Index

RSS

Atom