Академический Документы
Профессиональный Документы
Культура Документы
Notes-1
1. (a) Find the order and degree of the following recurrences relations. Determine
whether
they are homogeneous or non-homogeneous.
(b) Define :
(i) Simple graph
(ii) Finite and infinite graph
(iii) Isolated vertex
(iv) Subgraph
(c) Solve the recurrence relation.
(f) How many edges are there in a graph with 10 vertices each of degree 6 ?
(b) Draw a graph (connected) which can be both regular and bipartite ?
(b) Define Isomorphism of two graphs. Find whether the given graphs are isomorphic
or not.
4. (a) Find Euler's path in the graph given below :
Notes-2
Notes-3
1. (a) Define regular graph. Find the number of edges of a 4-regular graph with 6
vertices.
(b) Find the order of the following recurrences and state whether they are
homogeneous or non-homogeneous :
(c) Solve the recurrence relation xn+1 - 8xn + 15xn -1 = 0, where Xo = 5 and xl = 21.
(d) Find the generating function for the sequence 0, 1, - 2, 3, - 4.
(e) Determine whether the sequence {an) is a solution of the recurrence relation
(f) Is a Hamiltonian graph Eulerian ? Is a Eulerian graph Hamiltonian ? Show with the
help of a suitable example.
draw subgraphs
(i) G - e
(ii) G - a
(c) Is a subgraph of a planar graph, planar ? Justify your answer.
5. (a)