Graphs Definitions for MEI specification 0.0 / 5 ? Further MathsGraphsASOther Created by: lilyaasanchezCreated on: 19-12-16 16:56 Node / Vertex Points shown on the graph 1 of 17 Edge / Arc Lines between the nodes, where there is a vertex at each end 2 of 17 Loop An edge with the same vertex at each end 3 of 17 Node Order / Degree The number of edges coming out of a vertex 4 of 17 Simple A graph with NO LOOPS and NO MORE THAN ONE EDGE CONNECTING ANY PAIR OF VERTICES 5 of 17 Complete A graph which has all of the possible connections between pairs of vertices 6 of 17 Connected A graph where you could go from any vertex to another vertex using a sequence of edges 7 of 17 Bipartite There are two distinct parts/sets of vertices in the graph. Any edge can only go from a vertex in one set to a vertex in the other set 8 of 17 Walk A sequence of consecutive edges where the end of one edge (apart from the last) is the beginning of another 9 of 17 Trail A walk where NO EDGE is repeated 10 of 17 Path A trail where NO VERTEX and NO EDGE is repeated 11 of 17 Cycle A closed path which is like a loop but through a sequence of edges 12 of 17 Hamilton cycle A cycle which visits every vertex exactly once and only once before it returns to where it started 13 of 17 Tree A simple, connected graph with NO CYCLES, so there are NO LOOPS OR REPEATED EDGES either 14 of 17 Digraph A directed graph (in the name), so at least one edge has a direction designated to it 15 of 17 Planarity Where a graph can be drawn without any of the edges crossing 16 of 17 Isomorphism Where one graph can be stretched, twisted or otherwise distorted into the other 17 of 17
Comments
No comments have yet been made