D1

HideShow resource information
• Created by: anushka
• Created on: 21-05-15 11:40
GRAPH
consists of vertices (nodes) which are connected by edges (arcs)
1 of 17
SUBGRAPH
part of a graph
2 of 17
DEGREE/VALENCY
the number of edges incident to a vertex
3 of 17
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 in which no vertex appears more than once
4 of 17
WALK
a path in which you are permitted to return to vertices more than once
5 of 17
CYCLES
a closed 'path', i.e. the end vertex of the last edge is the start vertex of the first edge
6 of 17
LOOP
an edge that starts and finishes at the same vertex
7 of 17
SIMPLE GRAPH
one in which there are no loops and not more than one edge connecting any pair of vertices
8 of 17
DIRECTED EDGES
if the edges of a graph have a direction associated with them
9 of 17
TREE
a connected graph with no cycles
10 of 17
SPANNING TREE
a subgrpah which includes all the vertices of G and is also a tree
11 of 17
BIPARTITE GRAPH
consists of two sets of vertices, X and Y. the edges only joing vertices in X to vetices in Y, not vertices within a set
12 of 17
COMPLETE GRAPH
a graph in which every vertex is directly connected by an edge to each of the other vertices
13 of 17
COMPLETE BIPARTITE GPAPH
a graph in which there are r vertices in set X and s vertices in set Y
14 of 17
ISOMORPHIC GRAPHS
shows the same infomation but are drawn differently
15 of 17
records the number of direct links between vertices
16 of 17
DISTANCE MATRIX
records the weights on the edges
17 of 17

Other cards in this set

part of a graph

SUBGRAPH

Card 3

Front

the number of edges incident to a vertex

Card 4

Front

a finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once

Card 5

Front

a path in which you are permitted to return to vertices more than once