Questions in Graph Theory:
In the subject of the degree sequence of graph, answer thefollowing:
- When does a d-regular graph have an Eulerian trail? and Whendoes it have an Eulerian circuit? Note: a d-regular graph is onewith degree sequence (d, d, d, . . . , d) for example.
- Can a tree be a regular graph? Why or why not
