Isomorphism of graphsAQA A-Level Further Maths: Mind map
What this mind map covers
- Definition
- Necessary conditions
- Not sufficient
- Prove isomorphic
- Prove not isomorphic
- Matrices
Exam questions on Isomorphism of graphs
- Graph has 6 vertices, 8 edges and degree sequence 4, 3, 3, 2, 2, 2.A graph has 6 vertices, 8 edges and degree sequence 4, 4, 2, 2, 2, 2. Explain why is not isomorphic to .2 marks
- Graph has vertices and edges , , , , and . Graph has vertices 1 to 5 and edges 12, 23, 34, 45, 51 and 25.The graph has vertices 1 to 5 and edges 12, 23, 31, 34, 45 and 35. Explain why is not isomorphic to .2 marks
- Graph has vertices and adjacency matrix, with rows and columns in this order, . Graph has vertices and edges , , and .Show that and satisfy the necessary conditions for isomorphism: the same number of vertices, the same number of edges and the same degree sequence.3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).