Scribd
Upload
240 views

Question Bank For Graph Theory Final 1

Graph theory questions bank 3bsc 6sem

Uploaded by

jayashwaghmare92
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
240 views

Question Bank For Graph Theory Final 1

Graph theory questions bank 3bsc 6sem

Uploaded by

jayashwaghmare92
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

B.Sc.

Part III Semester VI


Subject: Mathematics
Paper XII: Graph Theory

Unit I
1. For graph G with e edges and n vertices, the sum of degrees of all vertices is equal to:
a) 2e b) e/2 c) e+1 d) e-1

Ans: a) 2e

2. The vertex with degree one is called as:


a) even vertex b) odd vertex c) pendent vertex d) isolated vertex
Ans: c) pendent vertex
3. A vertex of a graph is called odd if its degree is ….
a) even b) empty c) odd d) None of these
Ans: c) odd

4. The number of vertices of odd degree in a graph is always....


a) even b) odd c) Even and odd d) None of these
Ans: a) even
5. A graph that has neither loops nor parallel edges is called
a) simple graph b) complete graph c) planar graph d) None of these
Ans: a) simple graph

6. A graph G=(V, E) is said to be a null graph if....


a) 𝑉 = ∅ b) 𝑉 ≠ ∅ c) 𝐸 = ∅ d) 𝐸 ≠ ∅
Ans: c) 𝑬 = ∅

7. A graph in which all vertices are of equal degree is called.....


a) planar graph b) complete graph c) simple graph d) regular graph
Ans: d) regular graph

8. If no vertices appears more than once in an edge sequence then it is called as......
a) a circuit b) a cutset c) a walk d) a path
Ans: d) a path

9. A simple graph with n vertices and k components can have atmost…..edges


a)(𝑛 − 𝑘)(𝑛 − 𝑘 − 1)/2 b) (𝑛 − 𝑘)(𝑛 + 𝑘 + 1)/2
c) (𝑛 − 𝑘)(𝑛 − 𝑘 + 1)/2 d) (𝑛 + 𝑘)(𝑛 − 𝑘 + 1)/2
Ans: c) (𝒏 − 𝒌)(𝒏 − 𝒌 + 𝟏)/𝟐
10. The maximum number of edges in a simple graph with n vertices is …
a) 𝑛(𝑛 + 1)/2 b) 𝑛(𝑛 − 1)/2 c) (𝑛 + 1)/2 d) (𝑛 − 1)/2
Ans: b) 𝒏(𝒏 − 𝟏)/𝟐

Unit II
1. The total number of pendent vertices in a binary tree with n vertices are:
a) n-1 b) n+1 c) (n-1)/2 d) (n+1)/2
Ans: d) (n+1)/2
2. Every connected graph has at least:
a) one spanning tree b) Two spanning tree c) three spanning tree d) None of these
Ans: a) one spanning tree

3. The length of the longest path in a tree is called its….


a) centre b) radius c) diameter d) walk
Ans: c) diameter

4. A tree with n vertices has .......edges


a) n-1 b) n+1 c) 1 d) 0
Ans: a) n-1

5. An edge in a spanning tree T is called as ......


a) branch b) chord c) cut-set d) circuit
Ans: a) branch
6. A vertex with minimum eccentricity in a graph G is called .......
a) diameter b) radius c) centre d) None of these

Ans: c) centre

7. If a tree has n vertices (𝑛 ≥ 2)then the number of labelled trees are......


a) 𝑛(𝑛−2) b) 𝑛(𝑛−1) c) 𝑛2 d) 𝑛(𝑛+1)

Ans: a) 𝒏(𝒏−𝟐)

8. A tree in which one vertex is distinguished from all others is called a :


a) binary tree b) rooted tree c) free tree d) spanning tree
Ans: b) rooted tree
9. The number of different rooted labelled trees with n vertices is:

a) 𝑛(𝑛−2) b) 𝑛(𝑛−1) c) 𝑛2 d) 𝑛(𝑛+1)

Ans: b) 𝒏(𝒏−𝟏)

10. For any connected graph with n vertices, e edges its spanning tree has……..chords

a) 𝑒 − 𝑛 + 1 b) 𝑒 − 𝑛 − 1 c) 𝑒 + 𝑛 + 1 d) 𝑒 − 𝑛 + 2

Ans: a) 𝒆 − 𝒏 + 𝟏

Unit III

1. The number of edges common in circuit and cutset are:


a) even b) odd c) empty d) none of these
Ans: a) even
2. The number of edges in the smallest cutset of a connected graph is called as:
a) vertex connectivity b) edge connectivity c) bridge d) none of these
Ans: b) edge connectivity

3. The formula n-e+f=2 for planar graph is given by.......


a) Euler b) Cayley c) Kuratowski d) Hamiltonian
Ans: a) Euler

4. A connected graph is said to be seperable if its vertex connectivity is :

a) 0 b) 1 c) 2 d) 3

Ans: b) 1

5. Every cutset in a non seperable graph with more than two vertices contain at least........
a) one edge b) two edges c) three edges d) none of these
Ans: b) two edges

6. The complete graph of five vertices is called as :


a) planar graph b) non planar graph c) vertex graph d) bipertite graph
Ans: b) non-planar graph
7. A connected graph G is a tree iff adding an edge between any two vertices in G creates
exactly.........
a) one circuit b) two circuit c) three circuit d) many circuit
Ans: a) one circuit
8. If G is a planar graph with n vertices, e edges, f faces and k components then 𝑛 − 𝑒 + 𝑓 =. . ..
a) k+1 b) k-1 c) n+k d) n-k

Ans: a) k+1

9. A graph can be embedded in the surface of a sphere iff it can be embedded in :


a) a plane b) a circle c) a sphere d) a straight line
Ans: a) a plane
10. A graph with n vertices has…….labelled graphs
a) 2𝑛𝐶𝑛 b) 2𝑛𝐶1 c) 2𝑛𝐶0 d) 2𝑛𝐶2
Ans: d) 𝟐𝒏𝑪𝟐

Unit IV
1. The set Ws of all .......in WG forms a subspace of WG
a) circuit vectors without zero vector b) cutset vectors including zero vector
c) cutset vectors without zero vector d) None of these
Ans: b) cutset vectors including zero vector
2. The circuit subspace Wc and the cutset subspace Ws in the vector space of a graph are.......
a) orthogonal to each other b) parallel to each other
c) not orthogonal to each other d) not parallel to each other
Ans: a) orthogonal to each other

3. The dimension of the cutset subspace W s is equal to the.......


a) degree of vertex b) no. of edges c) rank of the graph d) nullity of the graph
Ans: c) rank of the graph

4. Subspaces Wl and Ws are said to be orthogonal complements iff...


a)𝑑𝑖𝑚(𝑊𝑙 ∪ 𝑊𝑠 ) = 0 b) 𝑑𝑖𝑚(𝑊𝑙 ∩ 𝑊𝑠 ) = 0 c) 𝑑𝑖𝑚(𝑊𝑙 ∪ 𝑊𝑠 ) = 1 d) 𝑑𝑖𝑚(𝑊𝑙 ∩ 𝑊𝑠 ) = 1
Ans: b) 𝒅𝒊𝒎(𝑾𝒍 ∩ 𝑾𝒔 ) = 𝟎
5. Minimum number of linearly independent vectors that spans the vectors in a vector space W is
called:
a) basis of vector space b) dimension of vector space c) span d) None of these
Ans: b) dimension of vector space

6. Let graph G be connected with 4 vertices and 5 edges then nullity =


a) 9 b) 5 c) 2 d) 4
Ans: c) 2

7. The dimension of cut-set subspace Ws is equal to the rank r of the graph and the number of cutset

vectors including 0 in W s is :
a) 2𝑟 b ) 3𝑟 c) 4𝑟 d) r

Ans: a)𝟐𝒓

8.Two subspaces W1 and W2 are said to be orthogonal to each other iff X.Y=….
(for all 𝑋 ∈ 𝑊1 , 𝑌 ∈ 𝑊2 )
a) 0 b) 1 c) X-Y d) X+Y
Ans: a) 0

9. The dot product of two vectors, one representing a subspace g and the other g' is .....if the

number of edges common to g and g' is odd


a) zero b) one c) two d) three
Ans: a) zero

10. Let graph G be connected with 3 vertices and 3 edges then rank =
a) 0 b) 1 c) 2 d) 3
Ans: c) 2

Unit V
1.There is no rows with all zeros in the:
a) incidence matrix b) circuit matrix c) cutset matrix d) path matrix
Ans: d) path matrix

2. In an incidence matrix, a row with all zeros, represent :

a) pendent vertex b) isolated vertex c) odd vertex d) even vertex

Ans: b) isolated vertex

3. If A(G) is an incidence matrix of a connected graph G with n vertices then rank of A(G) is.........
a) (n+1)/2 b) (n-1)/2 c) n+1 d) n-1
Ans: d) n-1

4. If B is a circuit matrix of a connected graph G with n vertices and e edges, then rank of B is…
a) e+n+1 b) e-n+1 c) n-e+1 d) n+e-1
Ans: b) e-n+1
5. Each row in cutset matrix C(G) of a graph G is….
a) zero vector b) circuit vector c) cutset vector d) unit vector

Ans: c) cutset vector


6. In a cutset matrix C(G), a column with all zeros corresponds to an edge forming.....

a) a tree b) a binary tree c) a loop d) the parallel edges


Ans: c) a loop

7. In a graph without loops, the entries along principal diagonal of adjacency matrix are all:

a) zeros b) ones c) purely imaginary d) complex number


Ans: a) zeros

8. In path matrix, each row must contain atleast one ………

a) unit entry b) zero entry c) 0(mod 2) entry d) none of these

Ans: a) unit entry

9. In adjacency matrix if the graph is simple, then degree of a vertex equals the number of ….in

the corresponding row or column of adjacency matrix.

a) zeros b) ones c) two d) none of these


Ans: b) ones

10. In an incidence matrix, a row with a single unit entry corresponds to ……

a) pendent vertex b) isolated vertex c) odd vertex d) even vertex

Ans: a) pendent vertex

You might also like