19.03.2018 Views

linear-guest

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

7.3 Properties of Matrices 135<br />

Example 83 Graphs occur in many applications, ranging from telephone networks to<br />

airline routes. In the subject of graph theory, a graph is just a collection of vertices<br />

and some edges connecting vertices. A matrix can be used to indicate how many edges<br />

attach one vertex to another.<br />

For example, the graph pictured above would have the following matrix, where m i j<br />

indicates the number of edges between the vertices labeled i and j:<br />

⎛ ⎞<br />

1 2 1 1<br />

M = ⎜2 0 1 0<br />

⎟<br />

⎝1 1 0 1⎠<br />

1 0 1 3<br />

This is an example of a symmetric matrix, since m i j = mj i .<br />

Adjacency Matrix Example<br />

The set of all r × k matrices<br />

M r k := {(m i j)|m i j ∈ R; i ∈ {1, . . . , r}; j ∈ {1 . . . k}} ,<br />

is itself a vector space with addition and scalar multiplication defined as<br />

follows:<br />

M + N = (m i j) + (n i j) = (m i j + n i j)<br />

rM = r(m i j) = (rm i j)<br />

135

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!