11,000+
Interactive Demonstrations Powered by Notebook Technology »
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Adjacency Matrices of Manipulable Graphs
The adjacency matrix of a graph shows how the vertices are connected; when the entry at row
, column
is 1 in the matrix, the vertices
and
are connected. Moving the points leaves the adjacency matrix the same.
Contributed by:
Ed Pegg Jr
THINGS TO TRY
Drag Locators
SNAPSHOTS
RELATED LINKS
Adjacency Matrix
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Adjacency Matrices of Manipulable Graphs
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/AdjacencyMatricesOfManipulableGraphs/
Contributed by:
Ed Pegg Jr
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Graceful Graphs
Ed Pegg Jr
Spectral Properties of Directed Cayley Graphs
Bill Langhoff
The Eigenvectors of a Random Graph
Michael Twardos
Topological Sort in DAGs
Jaime Rangel-Mondragon
Golay Code
Ed Pegg Jr
The Floyd-Warshall Algorithm on Adjacency Matrices and Directed Graphs
Adithya Vekatesan and Ankit Goyal
Graph of Inequalities
Ed Pegg Jr
Constructing and Manipulating Graphs
Karl Scherer
Network Centrality Using Eigenvectors
Brian Levinstein
Manipulable Petersen Graph
Gustavo Gordillo
Related Topics
Graph Theory
Linear Algebra
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+