+1-315-636-4485
+91 98151-74050 
This quiz contains multiple-choice problems on tree properties, cycles, tree traversal, spanning trees, prefix, postfix and infix notations.
What is a separable graph?
An undirected graph G which is connected and acyclic, is called
Bipartite graph
Cyclic graph
Tree
Forest
What is a star tree?
A tree having a single internal vertex and n-1 leaves
A tree having n vertices arranged in a line
A tree which has 0 or more connected subtrees
A tree which contains n vertices and n-1 cycles
A polytree is called
Directed acyclic graph
Directed cyclic graph
Bipartite graph
Connected graph
The tree elements are called
Vertices
Nodes
Points
Edges
A linear graph consists of vertices arranged in a line. True or false?
False
True
A graph that consists of a disjoint union of trees is called
Bipartite graph
Forest
Caterpillar tree
Labelled tree
Two trees are labelled isomorphic if
The graphs of the two trees are isomorphic
The two trees have same label
The graphs of the two trees are isomorphic and the two trees have the same label
The graphs of the two trees are cyclic
What is a bipartite graph?
A graph which contains only one cycle
A graph which consists of more than 3 number of vertices
A graph which has odd number of vertices and even number of edges
A graph which contains no cycles of odd length
If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is
m + n - 1
m - n
m*n
m*n + 1
In an n-ary tree, each vertex has at most __ children.
n
n^4
n*n
n - 1
An n-vertex graph has __ edges.
n^2
n - 1
n*n
n*(n + 1)/2
For an n-vertex undirected graph, the time required to find a cycle is
O(n)
O(n^2)
O(n + 1)
O(log n)
A binary cycle space forms a __ over the two-element field.
Triangular graph
Vector space
Binary tree
Hamiltonian graph
If G is a simple graph with n-vertices and n >= 3, the condition for G having a Hamiltonian circuit is
The degree of each vertex is at most n/2
The degree of each vertex is equal to n
The degree of every vertex is at least n+1/2
The degree of every vertex in G is at least n/2
