MTH 231 Lecture Notes - Lecture 24: Directed Graph, Two-Dimensional Electron Gas, Mixed Graph

• School: Oregon State University
• Department: Mathematics
• Course: MTH 231
• Professor: All

Document Summary

Pairs when each vertex in the pair is distinct (cid:883)(cid:882). (cid:883) graphs can also have direction info. simple directed graph has an edge set of order. * parenthesis indicate order matters as opposed to { } used in earlier examples (cid:4666)(cid:1853),(cid:1854)(cid:4667) (cid:1854) (cid:1853) (cid:1853) is incident to (cid:1854) (cid:1854) is incident from (cid:1853) (cid:1853) is called the terminal vertex. Applications: bus routes (cid:1858) (cid:1858) (cid:1854) (cid:1859) (cid:1857) (cid:1856) There are also graph types (cid:1875)/(cid:1871)(cid:1857)(cid:1872) (cid:1858) loops & multiple edges (textbook (cid:888)(cid:886)(cid:886)/(cid:883)(cid:882). (cid:883)) (cid:883)(cid:882). (cid:884) Delimitation: (cid:884) vertices (cid:1873) & (cid:1874) in an undirected graph are called adjacent or neighbors in. If (cid:1873) & (cid:1874) are end point of an edge in the edge is called (cid:1857) is called incident (cid:1875)/(cid:1866) & (cid:1874) & connects (cid:1873)& (cid:1874) (cid:1857) (cid:1874) (cid:1873) (cid:890) (cid:891) The (cid:4666)(cid:1874)(cid:4667) is called the neighborhood of (cid:1874) (cid:1873)(cid:1371) (cid:1873)(cid:1866)(cid:1867)(cid:1866) (cid:1873) (cid:4666)(cid:4667)={(cid:1873) :{(cid:1874)(cid:1873)}t for some }