All mind maps topics

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

  1. Graph GG has 6 vertices, 8 edges and degree sequence 4, 3, 3, 2, 2, 2.
    A graph LL has 6 vertices, 8 edges and degree sequence 4, 4, 2, 2, 2, 2. Explain why LL is not isomorphic to GG.2 marks
  2. Graph PP has vertices A,B,C,D,EA,B,C,D,E and edges ABAB, BCBC, CDCD, DEDE, EAEA and ACAC. Graph QQ has vertices 1 to 5 and edges 12, 23, 34, 45, 51 and 25.
    The graph RR has vertices 1 to 5 and edges 12, 23, 31, 34, 45 and 35. Explain why RR is not isomorphic to PP.2 marks
  3. Graph MM has vertices P,Q,R,SP,Q,R,S and adjacency matrix, with rows and columns in this order, (0110101111000100)\begin{pmatrix} 0&1&1&0 \\ 1&0&1&1 \\ 1&1&0&0 \\ 0&1&0&0 \end{pmatrix}. Graph NN has vertices W,X,Y,ZW,X,Y,Z and edges WXWX, XYXY, YZYZ and XZXZ.
    Show that MM and NN satisfy the necessary conditions for isomorphism: the same number of vertices, the same number of edges and the same degree sequence.3 marks
See the full worksheet

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).