Lovely Professional University 2010 B.Tech Computer Science and Engineering Assignment -2 Mathematics - Question Paper
Friday, 25 January 2013 03:10Web
MTH-252 Discrete Mathematics and probability Theory
HomeWork-2
Lecture No. 10
Part-A
1) Use generating function to solve the recurrence relation
condition (equation with the attachment)
2) Use generating function to obtain an explicit formula for Fibonacci numbers.
3) Can a simple graph exists with 15 vertices every of degree five?
Part-B
1) Consider the graph in fig one and obtain (figure with the attachment)
(a) the degree of every vertex and verify the handshaking lemma
(b) all simple paths from A to G
(c) all trails (Distinct edges) from B to C
(d) d(A,C), The distance from A to C
2) Show that the number of vertices of odd degree in a graph is always even.
3) Check whether the graphs are Isomorphic or not (figure with the attachment)
MTH-252 Discrete Mathematics and probability Theory
HomeWork-2 Lecture No. 10
Part-A
1) Use generating function to solve the recurrence relation
condition
2) Use generating function to find an explicit formula for Fibonacci numbers.
3) Can a simple graph exists with 15 vertices each of degree five?
Part-B
1) Consider the graph in fig 1 and find
(a) the degree of each vertex and verify the handshaking lemma
(b) all simple paths from A to G
(c) all trails (Distinct edges) from B to C
(d) d(A,C), The distance from A to C
2) Show that the number of vertices of odd degree in a graph is always even.
3) Check whether the graphs are Isomorphic or not
Earning: Approval pending. |