When 2 vertices have more than 1 arc going between them, they have this.
What are multiple edges?
100
The number of vertice plus the number of faces minus the of edges equals this.
What is 2?
100
The minimum amount of edges needed to make a connected graph with 11 vertices.
What is 10?
100
For a minimum spanning tree, you find this edge first.
What is the path with the smallest weight?
200
When a sequence of edges starts and finishes at the same vertex.
What is a circuit?
200
A vertex that has a degree of 0.
What is an isolated vertex?
200
A network that has 0 odd vertices contains this.
What is Euler or Eulerian circuit?
200
This is defined as the number of edges that comes out of each vertex in an undirected graph.
What is degree?
200
To find out whether an Eulerian path or Eularian circuit exists in a network, you first do this.
What is count the degree of each vertex?
300
This is where a path with a direct path between all vertices.
What is a complete graph?
300
A network that has no loops or multiple edges.
What is a simple graph?
300
An Eulerian path has 2 odd vertices. If it starts at one of the odd vertices, it will finish here.
What is the other odd vertex?
300
The number of vertices if a planar graph contains 5 faces and 12 edges is this.
What is 9?
300
This is the first 3 steps when performing a Hungarian algorithm.
What is subtract smallest number from each column, subtract smallest column from each row and cover the 0's with the least amount of lines?
400
The sum of the weights of the edges that a cut passes through.
What is capacity?
400
A graph that all edges can be travelled in either direction.
What is an undirected graph?
400
If a network contains 16 edges and the same number of faces and vertices, this is the number of vertices it has.
What is 9?
400
The number of edges on a complete graph with 30 vertices.
What is 435?
400
When using the Hungarian algorithm, how many lines covering the zeroes are you looking to achieve before progressing to the bipartite graph allocation?
The same number of lines as the jobs to be allocated.
500
The type of matrix used in a Hungarian algorithm that involves the price in dollars of 4 supermarkets being supplied by 4 suppliers.
What is a cost matrix?
500
When you start at one vertex, travel through each vertex once, and return to the origin vertex, you took this route.
What is a Hamiltonian circuit?
500
For Euler's formula to work, the network must be these 2 things.
What is connected and planar?
500
This is found by finding the capacity of the minimum cut.
What is maximum flow?
500
When using cuts to find a maximum flow, edges that cannot contribute to the flow of a network in the required direction are counted as this.