UNIT WISE PREVIOUS YEAR PAPERS QUESTIONS (2003-04 TO 2009-10) UNIT –I 1.
Prove that the sum of the degrees of all the vertices of a graph is even.(2003-04,05-06,09-10) 2. Show that the number of vertices with odd degree in any connected graph G is always even. (2004-05, 07-08, 08-09). 3. Prove that a simple graph with n vertices and k components can have at most ((n-k) (n-k+1))/2 edges. (2003-04, 05-06, 07-08, 09-10). 4. Show that the maximum number of edges in a simple graph with n vertices has (n(n-1))/2 edges. (2006-07) 5. Prove that a finite connected graph is Eulerian if and only if each vertex has even degree. (2003-04) 6. Prove that a graph is an Euler graph if and only if it can be decomposed into circuits.(2005-06) 7. Prove that in a complete graph with n vertices, there are (n-1)/2 edges disjoint Hamiltonian circuits, if n is odd number >=3. (2003-04, 05-06) 8. Prove that every graph with n vertices and at least n edges contains a circuit. (2004-05) 9. Define Euler graph .Give examples of Eulerian non Hamiltonian graph, Hamiltonian non eulerian graph and both Hamiltonian and eulerian and neither Hamiltonian nor eulerian. 10. Define Hamiltonian path .Find an example of a non-Hamiltonian graph with a Hamiltonian path. (2005-06) 11. Define a connected graph. Prove that for a graph with exactly two vertices of odd degree there must be a path joining these two vertices. (2007-08,08-09) 12. Discuss Travelling Salesman problem.(2004-05, 05-06, 09-10) 13. Isomorphism, Sub graph, spanning sub graph, homeomorphic graphs, unicursal line , arbitrarily traceable subgraph, dodecahedron, Peterson graph, complete graph, bipartite graph , cut points of a graph, infinite graph, component of a graph, multigraph 14. Discuss the operations on a graph( ring sum ,union, intersection, deletion, merging). 15. Let G be a simple regular graph with n vertices and 24 edges. Find all the possible values of n and give examples of each. (2004-05). 16. Show that the complement of a bipartite graph need not to be a bipartite.(2006-07) 17. Discuss Konigsberg bridge problem. (2006-07) 18. What is the largest number of vertices in a graph with I. 35 edges if all vertices are of degree at least 3. II. 24 edges and all vertices of the same degree. (2006-07) 19. If the intersection of two paths is a disconnected graph, show that the union of the two paths has at least one circuit. (2008-09)
(2007-08) 14.08-09) 6. (2003-04) 3. (2003-04. Find the examples of two non-isomorphic trees with vertices > 10 having equal diameters.09-10) 5. Prove that every tree has one or two centre.0910) 8. (2003-04) 9. Discuss Kruskal. (2006-07. Prove that a connected graph G is a tree if G has fewer edges than vertices. radius and centre of a tree. Under what condition does this inequality hold? Elaborate. (2006-07) 13. Prove that the number of pendant vertices in a binary tree with n vertices is (n+1)/2. (2004-05) 7.06-07. If G is a non trivial tree. prove all the properties of a tree.07-08. Show that a Hamiltonian path in a graph is a spanning tree. Also. Show a tree in which its diameter is not equal to twice of the radius. (200910) 10. Find the rank and nullity of dodecahedron. Prims and dijikstra algorithm. Define the diameter. Define binary tree and state two applications of it in computer science.09-10) 12.08-09. Explain what is meant by spanning tree. What is a tree? What are the different properties when a graph G with n vertices is called a tree. eccentricity.04-05.t any of its spanning trees a connected graph with n vertices and e edges has n-1 branches and e-n+1 chords.(2004-05. Define the pendant vertices in a binary tree. then prove that G contains at least two vertices of degree one. (2005-06.(2003-04) 4.r.08-09.07-08) 11. (2006-07. Prove that w. A graph is given in the question and you have to find out the different spanning trees or all the fundamental circuits or fundamental cutsets for that graph . Define rank and nullity of a graph.UNIT -II 1.05-06. 2. (2008-09)
Prove that in a non-separable graph G set of edges incident on each vertex of G is a cutset.t any one of its spanning trees.r.r. (2009-10) 16. Define a planar graph. Show that Kuratowski’s two graphs are non planar.06-07) 18. number of edges and number of regions of a planar graph respectively. Define the edge connectivity and the vertex connectivity of a graph.07-08. Show by sketching that the thickness of eight vertex complete graph is two and that of nine vertex complete graph is three. show that e= k (n-2)/k-2. e and f are the number of vertices.t a spanning tree). Vertex connectivity of G=3 and degree of every vertex of G>=3. Show that a complete graph with four vertices is a self dual. 3. e>= 3f/2 and e<= 3n-6 where n is the number of vertices(>=3) and e is the number of edges (e>1) and f is the number of regions in G. (2003-04. Establish the inequalities for a planar graph G.08-09) 2. If every region of a simple planar graph (with n vertices and e edges) is bounded by k edges. Define thickness and crossing number of a graph. (2004-05). Prove that a graph has a dual if and only if it is planar.t the vertex pair v2.(2003-04) 5. (2008-09) 4. Find thickness and crossing numbers of Kuratowski’s first graph(K5) and Kuratowski’s second graph ( K3. Define a separable graph. 6. 7.v3 in the following graph:
(2009-10) 12. Prove that the vertex connectivity of any graph will never be more than the edge connectivity.(2008-09) 8. Give an example of a non-separable graph with 8 vertices and 16 edges. (2004-05. Define a non-separable graph G. (2004-05).09-10) 17. Define cutsets.3 is non planar. Define the fundamental cut-sets of a graph G (w. (2003-04. (2009-10) 10.3).08-09).(2007-08) 9. Find out all the fundamental cut sets of K5 w. Use Ford Fulkerson method to find the maximum flow of the network: (2003-04)
. (2003-04) 14. (2003-04.(2007-08) 15. Construct a graph G with the following properties: edge connectivity of G=4. List all the cutest w.(2008-09) 13. find these numbers for the dual of this graph. Prove that for a graph G with n vertices and e edges vertex connectivity<= edge connectivity <= 2e/n.r. Show that complete bipartite graph K3.(2007-08. State and prove the Euler’s theorem for a planar graph. Define the dual of a graph. Also in n.09-10) 11.UNIT – III 1.
Detect the planarity of the graphs K 5 and K3.
. Write an algorithm to detect the planarity of a graph.(2004-05) 21. Prove that in a graph every circuit has an even number of edges in common with any cutest. Define the capacity of a cut-set. (2004-05) 22. (2007-08) 20.19. Find edge connectivity and the vertex connectivity of the given graphs. Prove that the maximum flow possible between the two vertices a and b in a network is equal to the minimum of capacities of all cut-sets with respect to a and b.3. Draw a spanning tree of the following graph and list all the fundamental circuits with respect to this tree.(2006-07)
Consider the circuit matrix (B) and incidence matrix (A) of a simple connected graph whose columns are arranged using the same order of edges. Also verify the result with an example. Let X(G) be an adjacency matrix of a simple graph G.07-08. cutset matrix. Prove that a tree with two or more vertices is 2-chromatic.07-08. 5. circuit matrix. (2006-07. fundamental cutset matrix. (2004-05) 10. reduced incidence matrix.UNIT 4 1.05-06.08-09. Define a vector space associated with a graph G and its two subspaces the circuit and cutest subspace. Define incidence matrix. (2007-08) 4.. Define the chromatic number and chromatic polynomial of graph G. Then prove that every row of B is orthogonal to every row of A.05-06)
. Prove that the two graphs G1 and G2 are isomorphic if and only if A(G1) and A(G2) differ only by the permutations of rows and columns. path matrix and adjacency matrix. State and prove five color theorem. Find an example of a 2-chromatic graph which is not a tree. Prove that the rank of the incidence matrix is n-1. (2008-09) 11.(2006-07) 12.09-10) 3. fundamental circuit matrix.09-10) 9.( 2r-2r-1) (2009-10) 14. Define the k-chromatic graph.(2005-06) 6.(2004-05) 13. Find the chromatic polynomial of the following graphs. (2004-05. Define basis vector of a graph. Prove that the rank of a cut set matrix is equal to the rank of the graph.08-09)
IV) 2. Also find the chromatic polynomial of a tree.(2009-10) 7. Prove that the rank of the circuit matrix of a connected graph is equal to the nullity of the graph. then prove that ij the entry is Xr is the number of different edge sequences of r edges between vertices vi and vj . fundamental circuit matrix Bf and fundamental cut-set matrix Cf of a connected graph.(2004-05.(2006-07.09-10) 8. Prove that an m-vertex graph is a tree if and only if its chromatic polynomial is Pm(λ)= λ (λ-1)m-1 (2003-04. Find all the distinct bases of the circuit subspace of K5. Show that the number of distinct basis possible in a cut-set subspace is 1/r!(2r-20)( 2r -21)( 2r-22)………. Derive the relationship between reduced incidence matrix Af. Prove that the circuit subspace and cutest subspace are orthogonal to each other.
if the number of common edges is odd. Define a cut-set vector and circuit vector of a graph. one representing a subgraph g and other g’.
Q17 Q18. Explain the dot product of two vectors and orthogonal vectors. Define a vector space of graph. 18. Find the set of all cut-set vectors and the set of all circuit vectors of the following graph. Define basis vectors of a graph. Find five base and number of vectors in the vector space of graph of graph given. Also find five cutest vectors and five circuit vectors of this vector space.15. (2006-07) 16. Find the number of distinct basis possible in a cutest subspace. is zero if the number of common edges to g and g’ is even and the dot product is 1. 17. Prove that the dot product of two vectors.(2003-04)