Discrete Mathematics - Graphs 5.0 / 5 based on 1 rating ? MathematicsGraphs and transformationsInternational BaccalaureateNone Created by: Jason BrowneCreated on: 05-09-12 11:48 Vertex point at which one must make a decision where to go. 1 of 16 Edges Are lines connecting verticies 2 of 16 Simple Graphs Do no have multiple edges or loops 3 of 16 Degree number of edges that intersect a vertex 4 of 16 Subgraph A graph within a graph 5 of 16 Connected graph all vertices are linked by an edge 6 of 16 Complete graph each vertex in connected by precisely one edge to every other vertex. 7 of 16 Bipartite graph 2 sets of verticies =- edges connect vertices from 1 set to the other but no within a set 8 of 16 Order Number of verticies 9 of 16 Regular ever vertex has the same degree 10 of 16 Planar graph A graph in which no two edges intersect as a point which is not a vertex 11 of 16 Walk A sequence of linked edges 12 of 16 Trail A walk in which no edge is used more than once 13 of 16 Circut A trail that begins and ends at the same vertex. 14 of 16 Eulerian Trail Every edge of a graph is used once 15 of 16 Elerian Circut Every edge of a graph only used once and finishes where it started 16 of 16
Comments
No comments have yet been made