Adjacency matrix

999 views

Published on

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
999
On SlideShare
0
From Embeds
0
Number of Embeds
5
Actions
Shares
0
Downloads
8
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Adjacency matrix

  1. 1. Adjacency Matrix Prepared by: Eileen M. Pagaduan
  2. 2. Adjacency Matrix Connection matrix N x n matrix A= (Aij) in which the entry aij= 1 if there is an edge form vertex i to j and is 0 if there is no edge from vertex i to j. Matrix with rows and columns labeled by graph vertices with 1 or 0 in position.
  3. 3. Adjacency Matrix Simple graph with no loops: 0s on the diagonal Undirected graph: symmetric Representing which vertices (or nodes) of a graph are adjacent to which other vertices.
  4. 4. Example:
  5. 5. References: http://en.wikipedia.org/wiki/Adjacency_matrix http://mathworld.wolfram.com/AdjacencyMatrix.html http://www.mathcove.net/petersen/lessons/get- lesson?les=8

×