A graph consists of vertices or nodes which are connected by edges or arcs.
1 of 13
Subgraph
A graph which has edges and nodes from a larger graph.
2 of 13
Network
A graph with a number associated to each edge (called weight).
3 of 13
Degree/Valency
A valency of a vertex is the number of edges incident to it.
4 of 13
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.
5 of 13
Cycle
A closed path.
6 of 13
Digraph
A graph with directed edges.
7 of 13
Tree
A connected graph with no cycles.
8 of 13
Spanning Tree
A subgraph which includes all the vertices of G and is also a tree
9 of 13
Complete Graph
A graph in which each of the n vertices is connected to every other vertex.
10 of 13
Total Float
The total float F(i,j) of activity (i,j) is defined to be F(i,j) = l(j)-e(i)-duration, where e is the earliest time for event i and l is the latest time for event j.
11 of 13
Bipartite graph
Consists of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set.
12 of 13
Matching
A matching is the pairing of some or all of the elements of one set, X, with elements of a second set, y. If every X is connected to a Y then the matching is a complete matching.
13 of 13
Other cards in this set
Card 2
Front
A graph which has edges and nodes from a larger graph.
Back
Subgraph
Card 3
Front
A graph with a number associated to each edge (called weight).
Back
Card 4
Front
A valency of a vertex is the number of edges incident to it.
Back
Card 5
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.
Comments
No comments have yet been made