Graph Theory

Find the shortest path distance from A to D. Edges: A-B(3), A-C(1), B-D(2), C-B(1), C-D(6)

A graph has vertices A, B, C, D with edges: A-B, A-C, A-D, B-C, C-D. What is the degree of vertex A?

A graph has vertices A, B, C, D, E with edges: A-B, A-C, B-C, B-D, C-D, D-E. How many edges does it have?

A tree has 8 vertices. How many edges does it have?

Find the weight of the minimum spanning tree for this graph. Edges: A-B(4), A-C(2), B-C(5), B-D(3), C-D(7), C-E(6), D-E(1)

In a directed graph, vertex A has edges going TO B, C, D and edges coming FROM E, B. What is the out-degree of A?

Which of the following graphs has an Euler circuit? (Vertex degrees listed)

A graph has 5 vertices with degrees 2, 3, 3, 2, 2. How many edges does it have?