Other Maths

Topics

<< < (115/115)

[1] Graph 1 is connected and every edge is a bridge. Graph 2 is such that for any pair of vertices in ...

[2] Assume that G is a graph with 10 vertices. It is known that one vertex has degree 9 and the other ...

[3] Assume that G is a graph with no loops or multiple edges. It is known that G has 5 vertices, 4 ...

[4] The number of vertices in a tree with 57 edges is

[5] The number of edges in a tree with 57 vertices is

[6] Which of the following four graphs is a tree?

Navigation

[0] Up one level

[*] Previous page