This download link is referred from the post: SGBAU BSc Last 10 Years 2010-2020 Question Papers || Sant Gadge Baba Amravati university
FirstRanker.com
A Firstranker's choice
AW-1761
--- Content provided by FirstRanker.com ---
B.Sc. Part-III (Semester-VI) ExaminationMATHEMATICS
(Graph Theory)
Paper—XII
Time : Three Hours] [Maximum Marks : 60
--- Content provided by FirstRanker.com ---
Note :— (1) Question No. 1 is compulsory and attempt it at once only.
(2) Solve ONE question from each unit.
- Choose the correct alternative in the following :
- A connected graph G is an Euler graph iff it can be decomposed into : 1
- Walks
- Paths
- Cut sets
- Circuits
--- Content provided by FirstRanker.com ---
- A subgraph H = <V, E> of a graph G = <V, E> is called a spanning subgraph if 1
- E = ¢
- V1=¢
- V1=V
- E1 =E
--- Content provided by FirstRanker.com ---
- The concept of a tree was introduced by : 1
- Euler
- Hamiltonian
- Cayley
- Kuratowski
--- Content provided by FirstRanker.com ---
- If G be a circuitless graph with n vertices and k components then G has : 1
- n+ 1 edges
- n -1 edges
- n + k edges
- n -k edges
--- Content provided by FirstRanker.com ---
- A graph can be embedded in the surface of a sphere iff it can be embedded in : 1
- a plane
- a circle
- a sphere
- a straight line
--- Content provided by FirstRanker.com ---
- A complete graph of five vertices is : 1
- Planar graph
- Non-planar graph
- Null graph
- Bipartite graph
--- Content provided by FirstRanker.com ---
- Minimum number of linearly independent vectors that spans the vectors in a vector space W, is called : 1
- Basis of vector space
- Dimension of vector space
- Span
- None of these
--- Content provided by FirstRanker.com ---
- The dimension of the cutspace W is equal to the rank of the graph and the number of cutset vectors including 0 in Wt is : 1
- r
- 2r
- 3r
- 4r
--- Content provided by FirstRanker.com ---
- A row with all zeros in incidence matrix represents : 1
- Pendent vertex
- Isolated vertex
- Odd vertex
- Even vertex
--- Content provided by FirstRanker.com ---
- If B is a circuit matrix of a connected graph G with n vertices and e edges then rank of B is : 1
- e+n-1
- e—n-1
- e+n+1
- e-n+1
--- Content provided by FirstRanker.com ---
- A connected graph G is an Euler graph iff it can be decomposed into : 1
UNIT—I
- (a) Define (i) Simple graph, (ii) Degree of a vertex. Show that the maximum number of edges in a simple graph of n vertices is E(n(n-1)/2). 2+3
--- Content provided by FirstRanker.com ---
(b) Define isomorphism between two graphs. Prove that any two simple connected graphs with n vertices, all of degree two are isomorphic. 2+3 - (p) From the graph given below answer the following :
V1
(i) Write the degree of each vertex.
(ii) Which edges are incident with the vertex V1 ?--- Content provided by FirstRanker.com ---
(iii) Write the adjacent vertices of V1.
(iv) Is the graph simple ? Why ? 1+1+1+2
(q) In a graph G there exists a path from the vertex u to the vertex v iff there exists a walk from u to v. 5
UNIT—II
- (a) Prove that following statements are equivalent :
--- Content provided by FirstRanker.com ---
(i) There is exactly one path between every pair of vertices in G.
(ii) G is minimally connected graph. 5
(b) Define : (i) Binary tree. (ii) Rooted tree. Show that there are (n + 1)/2 number of pendent vertices in a binary tree with n vertices. 2+3
- (p) Define eccentricity of a tree. Find out radius and centres. 1+4
(q) Define spanning tree and find out all possible spanning trees of the following graph. 1+4--- Content provided by FirstRanker.com ---
UNIT—III
- (a) Define planar graph. If G is planar graph with n vertices, e edges, f faces and k components then prove that n — e + f = k + 1. 1+4
(b) Prove that every cutset in a connected graph G must contain at least one branch of every spanning tree of a graph G 5 - (a) Define fundamental circuits for the following graph G, find rank of G, nullity of G and fundamental circuits with reference to the spanning tree : T = {b1, b2, b3, b4, b5, b6}.
--- Content provided by FirstRanker.com ---
1+4
(b) Show that Kuratowski’s K3,3 graph is non-planar. 5
UNIT—IV
- (a) Prove that in the vector space of a graph the circuit subspace and cutset subspace are orthogonal to each other. 5
--- Content provided by FirstRanker.com ---
(b) For a graph G with spanning tree T = {e1, e2} find Wc, Wt, Wc ∩ Wt and Wc U Wt 5 - (p) Prove that the set W of all circuit vectors including zero vector in Wc, form a subspace of Wv. 5
(q) Let G be a graph given as in figure. Find Wc, Wt, Wc ∩ Wt and Wc U Wt where Wc is a circuit subspace and Wt is a cutset subspace. 3
UNIT—V
--- Content provided by FirstRanker.com ---
- (a) Prove that the reduced incidence matrix of graph is non-singular iff the graph is a tree. 5
(b) Define circuit matrix. Find the circuit matrix of the graph. 1+4
- (p) Find incidence matrix A(G), circuit matrix B(G) and show that ABT = 0, for the following graph 5
--- Content provided by FirstRanker.com ---
(q) Define the Adjacency matrix. Find the Adjacency matrix of the following graph. 1+4
--- Content provided by FirstRanker.com ---
This download link is referred from the post: SGBAU BSc Last 10 Years 2010-2020 Question Papers || Sant Gadge Baba Amravati university