MAS 801 It's a Discreetly Discrete World – Mathematics in Real-life ...
MAS 801 It's a Discreetly Discrete World – Mathematics in Real-life ...
MAS 801 It's a Discreetly Discrete World – Mathematics in Real-life ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Lecture 9: 22 October 2008<br />
Adjacency Matrix of a Digraph<br />
Adjacency Matrix<br />
• Given a digraph G with n vertices, its adjacency matrix is the n x n<br />
matrix A whose entry <strong>in</strong> row i and column j is given by<br />
aij =<br />
{ 1,<br />
if (i, j) is an arc of G<br />
0, otherwise