Graphs and Networks 2 (AQA A-Level Further Maths): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
How is an undirected loop at a vertex recorded in an adjacency matrix?
How is an undirected loop at a vertex recorded in an adjacency matrix?
As 2
What property does an adjacency matrix have for an undirected graph?
What property does an adjacency matrix have for an undirected graph?
It is symmetric
How do you find the adjacency matrix of from the matrix of ?
How do you find the adjacency matrix of from the matrix of ?
Swap 0s and 1s, keep diagonal unchanged
What graph results from combining a simple graph with its complement ?
What graph results from combining a simple graph with its complement ?
The complete graph
How many edges does the complete graph have?
How many edges does the complete graph have?
If two graphs have the same degree sequence, are they definitely isomorphic?
If two graphs have the same degree sequence, are they definitely isomorphic?
No, it's necessary but not sufficient
For a planar graph with , , how many faces are there using Euler's formula?
For a planar graph with , , how many faces are there using Euler's formula?
5
A graph has and . What does tell us?
A graph has and . What does tell us?
Graph is definitely non-planar
Which complete graphs are non-planar?
Which complete graphs are non-planar?
if
According to Kuratowski's theorem, when is a graph non-planar?
According to Kuratowski's theorem, when is a graph non-planar?
If it has subdivision of or