This Paper is an intensive study of Eulerian and Hamiltonian graphs. Choose a graph of your own. For the graph you have come up with, complete the following tasks: Label the vertices and provide the vertex set and edge set. State degree sequence and provide the adjacency matrix. Find either an Eulerian circuit or an […]