D1 - Chapter 2 - Keywords 0.0 / 5 ? MathematicsD1ASNone Created by: Sydney97Created on: 17-09-14 19:15 Graph Consists of points connected by lines 1 of 22 Weighted Graph/Network A graph that has a number associated with each edge 2 of 22 Vertices/Nodes Points on a graph 3 of 22 Edges/Arcs Lines on a graph 4 of 22 Subgraph A subset of vertices together with a subset of the edges 5 of 22 Degree/Valency/Order The number of edges attached to a vertex 6 of 22 Path A finite sequence of edges such that the end vertex of one edge in the sequence is the start vertex of the next and no vertex is repeated 7 of 22 Walk A path where you are allowed to return to vertices more than once 8 of 22 Cycle/Circuit A closed path, i.e. the end vertex of the last edge is the start vertex of the first edge 9 of 22 Connected Graph All vertices are joined by a path 10 of 22 Loop An edge that starts and finishes at the same vertex 11 of 22 Simple Graph A graph in which there are no oops and not more than one edge connecting any pair of vertices 12 of 22 Directed Edges Edges with an arrow on them showing the direction 13 of 22 Digraph A graph that has directed edges 14 of 22 Tree A connected graph with no cycles 15 of 22 Spanning Tree A subgraph which includes all the vertices of the graph and is a tree 16 of 22 Complete Graph Every vertex is connected to every other vertex 17 of 22 Bipartite Graph Where two sets of vertices connect to vertices in the opposite set only 18 of 22 Complete Bipartite Graph All vertices in each set are completely connected to the opposite set 19 of 22 Isomorphic Graphs The same graphs, only drawn differently 20 of 22 Adjacency Matrix Records the number of direct links between vertices 21 of 22 Distance Matric Records the weight on the edges. (No weight = – ) 22 of 22

## Comments

No comments have yet been made