Tut11.pdf - Mat1101 Tutorial Week 11 Introduction to graphs...

This preview shows page 1 - 3 out of 3 pages.

Mat1101 Tutorial Week 11Introduction to graphsGrossman Chapter 101. There are 11 simple non-isomorphic graphs with 4 vertices. Drawthem all.2. Write down the adjacency matrix corresponding to each of thetwo graphs below(a)????(b)?????
3. Classify each of the four graphs below as Eulerian, semi-Eulerianor neither, giving reasons for your answers. If the graph is Eule-rian, find a Eulerian circuit. If the graph is semi-Eulerian, find aEulerian path.(a)??????????????
End of preview. Want to read all 3 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
NoProfessor
Tags
Graph Theory, Leonhard Euler, Graph theory objects, Eulerian path, Hamiltonian path, Eulerian

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture