JSS MAHAVIDHYAPEETHA JSS ACADEMY OF TECHNICAL EDUCATION,NOIDA Department of Applied Mathematics Subject: Graph Theory

THEOREMS UNIT-1 1. 2. 3. 4. The sum of the degrees of all the vertices of a graph is an even number. The number of vertices of odd degree in a graph is always even. If a non-trivial graph has no-cycle then it must have a pendant vertex. If a graph has exactly two vertices of odd degree, there must be a path joining these two vertices. there exist a partition of vertex set V in G into and other in . and such that

5. A graph G is connected

there is no edge whose one end vertex is in

6. If degree of vertex in a graph is at least k then it contains a path of length at least k and a circuit of length k+1. 7. A simple graph with n vertices and k components can have at most (n-k)(n-k+1)/2 edges. 8. A connected graph is Euler if and only if each vertex of a graph is even. 9. In a connected graph G with exactly 2k odd vertices, there exist k edge-disjoint subgraphs such that they together contain all edges of G and that each is a unicursal graph. 10. A connected graph G is an Euler graph if and only if it can be decomposed into circuits. 11. In a complete graph with n vertices there are (n-1)/2 edge-disjoint Hamiltonian circuits, if n is an odd number 3. UNIT-2 12. A graph G is a tree if and only if there is one and only one path between every pair of vertices. 13. A tree with n vertices has n-1 edges. 14. Any connected graph with n vertices and n-1 edges is a tree. 15. A graph T is minimally connected 16. 17. 18. 19. 20. 21. 22. 23. T is a tree.

A graph G with n vertices and n-1 edges and has no circuit is connected. A tree (with two or more vertices) must contain at least two pendant vertices. The number of labeled trees with n vertices (n2) is n n-2. Prove that distance between vertices in a connected graph G is a metric. In a tree T prove that if r is the radius and d is diameter then prove that rd2r. The number of vertices in a binary tree is always odd. Prove that in a binary tree the no of pendant vertices is one more than the no of internal vertices. The maximum height of a binary tree on n vertices is [log 2(n+1)-1] where ([m] is the smallest integer>m) and maximum possible height is (n-1)/2. 24. Prove that the maximum number of vertices on level l of a binary tree is 2 l where l0. 25. A graph G is connected if and only if it has a spanning tree of G.

JSS MAHAVIDHYAPEETHA JSS ACADEMY OF TECHNICAL EDUCATION,NOIDA Department of Applied Mathematics Subject: Graph Theory

26. If T is a spanning tree of a connected graph G with n vertices and e edges then prove that there are n-1 tree branches and e-n+1 chords. 27. Prove that if T1 and T2 are two spanning trees of a graph G and if e is an edge of T 1 but not of T2 , there exist another edge f in T 2 but not in T1 such that subgraphs (T 1 e) f and (T1 f) e are

also spanning trees of G. 28. The distance between two spanning trees of a connected graph G is a tree. 29. Prove that the distance between two spanning tree of a graph satisfy the inequality

30. A graph G(n) is a tree addition of an edge between any two vertices creates exactly one cycle. 31. A spanning tree T of a weighted connected graph G is a shortest spanning tree of G if and only if there exist no other spanning tree of G at a distance one from T and shorter then T. UNIT-3 32. Every cut-set in a connected graph G must contain at least one branch of every spanning tree of G. 33. In a connected graph G, any minimal set of edges containing at least one branch of every spanning tree of G is a cut-set. 34. Every circuit has an even number of edges in common with any cut-set. 35. The ring sum of any two cut-sets in a graph is either a third cut-set or an edge-disjoint union of cut-sets. 36. With respect to a given spanning tree T, a chord c i that determines a fundamental circuit occurs in every fundamental cut-set associated with the branches in and in no other. 37. With respect to a given spanning tree T, a branch b i that determines a fundamental cut-set S is obtained in every fundamental circuit associated with the chords in S and in no others. 38. A vertex v in a connected graph G is a cut-vertex if and only if there exist two vertices x and y in G such that every path between x and y passes through v. 39. The edge connectivity of a graph G cannot exceed the degree of the vertex with the smallest degree in G. 40. The vertex connectivity of any graph G can never exceed the edge connectivity of G. 41. Every cut-set in a nonseparable graph with more than two vertices contains at least two edges. 42. The maximum vertex connectivity one can achieve with a graph G of n vertices and e edges (en-1) is the integral part of the number 2e/n. 43. The edge connectivity of a graph G is k if and only if every pair of vertices in G is joined by k or more edge-disjoint path and at least one pair of vertices is joined by exactly k edge-disjoint paths. 44. The maximum flow possible between two vertices a and b in a network is equal to the minimum of the capacities of all cut-sets with respect to a and b. 45. The complete graph of five vertices in non planer.

JSS MAHAVIDHYAPEETHA JSS ACADEMY OF TECHNICAL EDUCATION,NOIDA Department of Applied Mathematics Subject: Graph Theory

46. Kurotowskis second graph is nonplanner. 47. A connected planner graph with n vertices and e edges has e-n+2 regions. 48. In any simple connected planner graph with f regions, n vertices and e edges (e>2), the following inequalities must hold: e3f/2 , e3n-6. 49. A necessary and sufficient condition for two planner graphs G 1 and G2 to be duals of each other is as follows: there is one to one correspondence between edges in G 1 and G2 such that a set of edges forming a circuit in G1 corresponds to a set of edges forming a cut set in G2 and vice-versa. 50. A graph G is planner if and only if it has a dual. UNIT-4 51. The ring sum of two circuits in a graph G is either a circuit or an edge-disjoint union of circuits. 52. The set of all circuit vectors in WG forms a subspace W. 53. The set of circuit vectors corresponding to the set of fundamental circuits, with respect to any spanning tree, forms a basis for the circuit subspace W . 54. The set of cut-set vectors corresponding to the set of fundamental cut-sets, with respect to any spanning tree, forms a basis for the cut-set subspace W S. 55. In the vector space of a graph, the circuit subspace and the cut-set subspace are orthogonal to each other. 56. Two graphs G1 and G2 are isomorphic if and only if their incidence matrices A(G 1) and A(G2) differ only by permutations of rows and columns. 57. If A(G) is an incidence matrix of a connected graph G with n vertices, the rank of A(G) is n-1. 58. The reduced incidence matrix of a tree is nonsingular. 59. Let A(G) be an incidence matrix of a connected graph G with n vertices. An (n-1) by (n-1) submatrix of A(G) is nonsingular if and only if the (n-1) edges corresponding to the (n-1) columns of this matrix constitute a spanning tree. 60. If B is a circuit matrix of a connected graph G with e edges and n vertices, rank of B=e-n+1. 61. The rank of cut-set matrix C(G) is equal to the rank of the incidence matrix A(G) which equals the rank of graph G. 62. A tree with a at least two vertices is 2-chromatic. 63. If a graph G with at least one edge is bipartite if and only if its chromatic number is 2. 64. If dmax is the vertices of maximum degree in a graph G then chromatic number of G1+d max. 65. A graph G with at least one edge is 2-chromatic if and only if it contains no circuits of odd length. 66. Chromatic number of a planner graph is four. 67. The vertices of every planner graph can be properly colored with five colors. 68. The chromatic polynomial of a graph G is G is a complete graph of n vertices. 69. A graph G is a tree if and only if its chromatic polynomial is . if and only if

JSS MAHAVIDHYAPEETHA JSS ACADEMY OF TECHNICAL EDUCATION,NOIDA Department of Applied Mathematics Subject: Graph Theory

70. Let a and b be two nonadjacent vertices in a graph G. let G / be a graph obtained by adding an edge between a and b. Let G// be a simple graph obtained from G by fusing the vertices a and b together and replacing sets of parallel edges with single edges. Then of G= of G/ + of G// .