Which of the following statements for a simple graph is correct?
Anonymous Quiz
32%
Every path is a trail
30%
Every trail is a path
27%
Every trail is a path as well as every path is a trail
11%
Path and trail have no relation
What is the number of edges present in a complete graph having n vertices?
Anonymous Quiz
24%
(n*(n+1))/2
58%
(n*(n-1))/2
15%
n
3%
Information given is insufficient
A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
Anonymous Quiz
44%
15
33%
3
4%
1
19%
11
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
Anonymous Quiz
39%
(n*n-n-2*m)/2
35%
(n*n+n+2*m)/2
9%
(n*n-n-2*m)/2
17%
(n*n-n+2*m)/2
Which of the following properties does a simple graph not hold?
Anonymous Quiz
14%
Must be connected
28%
Must be unweighted
45%
Must have no loops or multiple edges
14%
Must have no multiple edges
What is the maximum number of edges in a bipartite graph having 10 vertices?
Anonymous Quiz
34%
24
41%
21
14%
25
10%
16
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
Anonymous Quiz
12%
v=e
48%
v=e+1
12%
v+1=e
28%
v=e-1
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Anonymous Quiz
32%
1,2,3
14%
2,3,4
14%
2,4,5
39%
1,3,5
A graph with all vertices having equal degree is known as a __________
Anonymous Quiz
21%
Multi Graph
18%
Regular Graph
21%
Simple Graph
39%
Complete Graph
Which of the following ways can be used to represent a graph?
Anonymous Quiz
48%
Adjacency List and Adjacency Matrix
15%
Incidence Matrix
24%
Adjacency List, Adjacency Matrix as well as Incidence Matrix
12%
No way to represent