**1) A graph is a collection of…. ?**

- Row and columns
**Vertices and edges**- Equations
- None of these

**2) The degree of any vertex of graph is …. ?**

**The number of edges incident with vertex**- Number of vertex in a graph
- Number of vertices adjacent to that vertex
- Number of edges in a graph

**3) If for some positive integer k, degree of vertex d(v)=k for every vertex v of the graph G, then G is called… ?**

- K graph
**K-regular graph**- Empty graph
- All of above

** ****4) A graph with no edges is known as empty graph. Empty graph is also known as… ?**

**Trivial graph**- Regular graph
- Bipartite graph
- None of these

**5) Length of the walk of a graph is …. ?**

- The number of vertices in walk W
**The number of edges in walk W**- Total number of edges in a graph
- Total number of vertices in a graph

**6) If the origin and terminus of a walk are same, the walk is known as… ?**

- Open
**Closed**- Path
- None of these

**7) A graph G is called a ….. if it is a connected acyclic graph ?**

- Cyclic graph
- Regular graph
**Tree**- Not a graph

**8) Eccentricity of a vertex denoted by e(v) is defined by…. ?**

**max { d(u,v): u belongs to v, u does not equal to v : where d(u,v) is the distance between u&v}**- min { d(u,v): u belongs to v, u does not equal to v }
- Both A and B
- None of these

**9) Radius of a graph, denoted by rad(G) is defined by…. ?**

**max {e(v): v belongs to V }**- min { e(v): v belongs to V}
- max { d(u,v): u belongs to v, u does not equal to v }
- min { d(u,v): u belongs to v, u does not equal to v }

**10) The complete graph K, has… different spanning trees?**

**n**^{n-2}- n*n
- n
^{n} - n
^{2}