This is a graph theory question (discrete mathematics) My assignment asks me to create a graph that includes 5-10 vertices and 5-10 edges. The scenario is for connecting high-speed network cables to all university campus buildings.

Please reference the attached screenshot

My first question is, can you see anything incorrect with my drawing (screenshot), and if so, could you please assist with what I need to do to correct it? In other words, I'm asking you to review my work and give me comments on whether my answer is correct or incorrect, as well as what I need to do to remedy it.

My second question is, I need help figuring out if it would be helpful to have an Euler or a Hamiltonian path/ circuit. If so, what is the most minimal path/circuit? Would you please describe in detail the route and how you determined it?

Thank you

The campus buildings of a university are connected via high-speed network cables using wide area network technology in this scenario. There are five vertices, with each vertices representing a connection point from one campus building computer node (switch) to another. There are five edges, each representing a segment of the network path between computer nodes in different campus buildings. E Vertex Edge D A B C Each vertex represents a connection point between two campus building computer nodes (switch) Each edge represents a network path from one campus building computer node to another