Graphs

**1.**In a graph if e=[u, v], Then u and v are called

**2.**A connected graph T without any cycles is called

**3.**In a graph if e=(u, v) means

**4.**. If every node u in G is adjacent to every other node v in G, A graph is said to be

**5.**Identify the correct problem for multistage graph from the list given below.

**6.**. Identify the correct problem for multistage graph from the list given below.

**7.**From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

**8.**Minimum number of spanning tree in a connected graph is

**9.**Find the odd out

**10.**

The minimum number of edges required to create a cyclic graph of n vertices is