A graph of G consists of points (vertices or nodes) which are connected by lines (edges or arcs).
1 of 18
Subgraph
A subgraph of G is a graph, each of whose vertices belongs to G and each of whose edges belongs to G.
2 of 18
Weighted graph
A graph with a number associated with each edge (usually called its weight).
3 of 18
Network
A graph with a number associated with each edge (usually called its weight).
4 of 18
Degree
The degree or valency of a vertex is the number of edges incident to it.
5 of 18
Valency
The degree or valency of a vertex is the number of edges incident to it.
6 of 18
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.
7 of 18
Cycle or circuit
A closed path, ie the end vertex of the last edge is the start vertex of the first edge.
8 of 18
Connected vertices
There is a path between them.
9 of 18
Directed edges
The edges which have a direction associated with them.
10 of 18
Digraph
The edges of the graph have a direction associated with them.
11 of 18
Tree
A connected graph with no cycles.
12 of 18
Spanning tree
A spanning tree of graph G is a subgraph which includes all the vertices of G and is also a tree.
13 of 18
Minimum spanning tree
A spanning tree such that the total length of its arcs is as small as possible.
14 of 18
Complete graph
A graph ion which each of the n vertices is connected to every other vertex.
15 of 18
Matching
The pairing of some or all of the elements of one set, X, with elements of a second set,Y.
16 of 18
Complete matching
Every member of X is paired with a member of Y.
17 of 18
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.
18 of 18
Other cards in this set
Card 2
Front
A subgraph of G is a graph, each of whose vertices belongs to G and each of whose edges belongs to G.
Back
Subgraph
Card 3
Front
A graph with a number associated with each edge (usually called its weight).
Back
Card 4
Front
A graph with a number associated with each edge (usually called its weight).
Back
Card 5
Front
The degree or valency of a vertex is the number of edges incident to it.
Comments
No comments have yet been made