Mat1101 Tutorial Week 11Introduction to graphsGrossman Chapter 101. There are 11 simple non-isomorphic graphs with 4 vertices.Draw them all.2. Write down the adjacency matrix corresponding to each ofthe two graphs below(a)????𝑨𝒂=⎡⎢⎢⎣?????0102?1110?0111?2010⎤⎥⎥⎦
Get answer to your question and much more
End of preview. Want to read all 3 pages?
Upload your study docs or become a
Course Hero member to access this document
Graph theory objects, Eulerian path, Hamiltonian path, isomorphic graphs