Sie sind auf Seite 1von 1

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE PILANI

HYDERABAD CAMPUS
Second Semester, 2016-2017
Test I (Closed Book)
Course No.: MATH F243 Course Title: Graphs and Networks
Date: 25.02.2017 Time: 8.30 A.M. 9.30 A.M.
Day: Saturday Max. Marks: 20
(Answer)
Notes: There are five questions. Answer all the questions. All graphs should be labeled properly. Different colors ink can
be used except red color. Marks for each question are given at the end of the question.

1. Total degree of the partite set U is 42. Since bipartite, total degree of W is also 42. Let x be the

number of vertices of degree 5, then (12x ) vertices are of degree 3. Hence,


5. x +3 ( 12x )=42 x=3 [2]
In the partite set U the number of vertices with degree 5 may range from 0 to 7. Hence the total number

vertices in G with degree 5 is 3+ v , 0 v 7 . [1]


2. The integer x cannot be an odd number since the graph contains even number of odd vertices. It

cannot be zero as there is only one vertex is of degree 7 which connects to every other vertices of G. [1]
Then, by Havel-Hakimi theorem, we can test for x=2, x=4 . It is found that for x=4 , G is

graphical.
[2]

[ ]
1 2 3 4
2 1 4 3
3. Automorphism Group: 3 4 1 2 [4]
4 3 2 1

Orbits: { v1 , v 2 } , { v 3 } , { v 4 } , { v 5 , v 6 } , { v 7 } , { v 8 } , {v 9 } [1]
Abelian: It satisfies the group and the commutative property. [1]

4. Prove by considering the average degree 2 m/n of G. [4]

5. The number of spanning trees is 8. [2+2]

_______________

Das könnte Ihnen auch gefallen