Transcription of Graph Theory - Gordon College
{{id}} {{{paragraph}}}
Example: bachelor of science
Graph Theory - Gordon College
Graph TheoryMAT230 Discrete MathematicsFall 2019 MAT230 (Discrete math ) Graph TheoryFall 20191 / 72 Outline1 Definitions2 Theorems3 Representations of Graphs: Data Structures4 Traversal: Eulerian and Hamiltonian Graphs5 Graph Optimization6 Planarity and ColoringsMAT230 (Discrete math ) Graph TheoryFall 20192 / 72 DefinitionsDefinitionAgraphG= (V,E) consists of a setVofvertices(also callednodes)and a an edge connects to a vertex we say the edge isincidentto the vertexand say the vertex is anendpointof the an edge has only one endpoint then it is called aloop two or more edges have the same endpoints then they are (Discrete math ) Graph TheoryFall 20193 / 72 DefinitionsDefinitionTwo vertices that are joined by an edge are is a vertex that is connected to exactly one other vertexby a single a Graph is a sequence of alternating vertices and +1withn 0. Ifv1=vn+1then the walk the walk is the number of edges in the walk.
If an edge connects to a vertex we say the edge is incident to the vertex and say the vertex is an endpoint of the edge. De nition If an edge has only one endpoint then it is called a loop edge. De nition If two or more edges have the same endpoints then they are called multiple or parallel edges. MAT230 (Discrete Math) Graph Theory Fall 2019 3 ...
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: