COMPSCI 225 Final: PrinciplesTheoremsDefinitions

537 views7 pages

Document Summary

A (cid:271) (cid:894)(cid:373)od (cid:373)(cid:895) iff (a b) 0 (mod m) |e| edges, sum of degree of vertices = 2|e| An undirected graph has an even sum of degrees. Every vertex is strongly connected to itself. If u is strongly connected to v then v is strongly connected to u. If u is strongly connected to v and v is to w then u is to w. The number of different paths of length r from vi to vj, where r z >1, equals the (i, j)th entry of the adjacency matrix. A connected multigraph has an euler circuit iff. An undirected graph has an even number of each of its vertices has even degree. vertices of odd degree. |e| = sum of negative degrees = sum of positive degrees. If there is a path from u to v then there is a simple path from u to v.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions