Minimum Spanning Trees (Edexcel A-Level Further Mathematics): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
In a network, what do weights on edges typically represent?
In a network, what do weights on edges typically represent?
Distances, costs, or capacities
In an adjacency matrix, what does indicate?
In an adjacency matrix, what does indicate?
Edge exists between and
In a weighted matrix, what value represents no edge between vertices and ?
In a weighted matrix, what value represents no edge between vertices and ?
What does a zero entry on the diagonal of a matrix typically mean?
What does a zero entry on the diagonal of a matrix typically mean?
No self-loop at that vertex
For undirected graphs, what property must the adjacency matrix have?
For undirected graphs, what property must the adjacency matrix have?
Symmetric:
What is the first step when drawing a network from a matrix?
What is the first step when drawing a network from a matrix?
Label vertices using rows/columns
When drawing a network from a matrix, which entries indicate edges?
When drawing a network from a matrix, which entries indicate edges?
Non-zero entries
In an adjacency matrix, what value indicates no edge?
In an adjacency matrix, what value indicates no edge?
What is the key difference between weighted and adjacency matrices?
What is the key difference between weighted and adjacency matrices?
Weighted uses weights, adjacency uses 1/0
For directed graphs, what property may not hold in the matrix?
For directed graphs, what property may not hold in the matrix?
Symmetry of entries