# 3. Eulerian and Hamiltonian Graphs

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from puzzles, namely, the Konigsberg Bridge Problem and Hamiltonian Game, and these puzzles also resulted in the special types of graphs, now called Eulerian graphs and Hamiltonian graphs. Due to the rich structure of these graphs, they find wide use both in research and application. 3.1 Euler Graphs A closed walk in a graph G containing all the edges of G is called an Euler line in G. A graph containing an Euler line is called an Euler graph. We know that a walk is always connected. Since the Euler line (which is a walk) contains all the edges of the graph, an Euler graph is connected except for any isolated vertices the graph may contain. As isolated vertices do not contribute anything to the understanding of an Euler graph, it is assumed now onwards that Euler graphs do not have any isolated vertices and are thus connected. Example Consider the graph shown in Figure 3.1. Clearly, v 1 e 1 v 2 e 2 v 3 e 3 v 4 e 4 v 5 e 5 v 3 v 6 e 7 v 1 in (a) is an Euler line, whereas the graph shown in (b) is non-eulerian. Fig. 3.1

2 60 Eulerian and Hamiltonian Graphs The following theorem due to Euler [74] characterises Eulerian graphs. Euler proved the necessity part and the sufficiency part was proved by Hierholzer [115]. Theorem 3.1 (Euler) of G are of even degree. A connected graph G is an Euler graph if and only if all vertices Proof Necessity Let G(V, E) be an Euler graph. Thus G contains an Euler line Z, which is a closed walk. Let this walk start and end at the vertex u V. Since each visit of Z to an intermediate vertex v of Z contributes two to the degree of v and since Z traverses each edge exactly once, d(v) is even for every such vertex. Each intermediate visit to u contributes two to the degree of u, and also the initial and final edges of Z contribute one each to the degree of u. So the degree d(u) of u is also even. Sufficiency Let G be a connected graph and let degree of each vertex of G be even. Assume G is not Eulerian and let G contain least number of edges. Since δ 2, G has a cycle. Let Z be a closed walk in G of maximum length. Clearly, G E(Z) is an even degree graph. Let C 1 be one of the components of G E(Z). As C 1 has less number of edges than G, it is Eulerian and has a vertex v in common with Z. Let Z be an Euler line in C 1. Then Z Z is closed in G, starting and ending at v. Since it is longer than Z, the choice of Z is contradicted. Hence G is Eulerian. Second proof for sufficiency Assume that all vertices of G are of even degree. We construct a walk starting at an arbitrary vertex v and going through the edges of G such that no edge of G is traced more than once. The tracing is continued as far as possible. Since every vertex is of even degree, we exit from the vertex we enter and the tracing clearly cannot stop at any vertex but v. As v is also of even degree, we reach v when the tracing comes to an end. If this closed walk Z we just traced includes all the edges of G, then G is an Euler graph. If not, we remove from G all the edges in Z and obtain a subgraph Z of G formed by the remaining edges. Since both G and Z have all their vertices of even degree, the degrees of the vertices of Z are also even. Also, Z touches Z at least at one vertex say u, because G is connected. Starting from u, we again construct a new walk in Z. As all the vertices of Z are of even degree, therefore this walk in Z terminates at vertex u. This walk in Z combined with Z forms a new walk, which starts and ends at the vertex v and has more edges than Z. This process is repeated till we obtain a closed walk that traces all the edges of G. Hence G is an Euler graph (Fig. 3.2) Fig. 3.2

3 Graph Theory Konigsberg Bridge Problem Two islands A and B formed by the Pregal river (now Pregolya) in Konigsberg (then the capital of east Prussia, but now renamed Kaliningrad and in west Soviet Russia) were connected to each other and to the banks C and D with seven bridges. The problem is to start at any of the four land areas, A, B, C, or D, walk over each of the seven bridges exactly once and return to the starting point. Euler modeled the problem representing the four land areas by four vertices, and the seven bridges by seven edges joining these vertices. This is illustrated in Figure 3.3. C C A B A B D Konigsberg Bridges D Underlying Graph Fig. 3.3 We see from the graph G of the Konigsberg bridges that not all its vertices are of even degree. Thus G is not an Euler graph, and implies that there is no closed walk in G containing all the edges of G. Hence it is not possible to walk over each of the seven bridges exactly once and return to the starting point. Note Two additional bridges have been built since Euler s day. The first has been built between land areas C and D and the second between the land areas A and B. Now in the graph of Konigsberg bridge problem with nine bridges, every vertex is of even degree and the graph is thus Eulerian. Hence it is now possible to walk over each of the nine bridges exactly once and return to the starting point (Fig 3.4). Fig. 3.4

4 62 Eulerian and Hamiltonian Graphs The following characterisation of Eulerian graphs is due to Veblen [254]. Theorem 3.2 A connected graph G is Eulerian if and only if its edge set can be decomposed into cycles. Proof Let G(V, E) be a connected graph and let G be decomposed into cycles. If k of these cycles are incident at a particular vertex v, then d(v) = 2k. Therefore the degree of every vertex of G is even and hence G is Eulerian. Conversely, let G be Eulerian. We show G can be decomposed into cycles. To prove this, we use induction on the number of edges. Since d(v) 2 for each v V, G has a cycle C. Then G E(C) is possibly a disconnected graph, each of whose components C 1, C 2,..., C k is an even degree graph and hence Eulerian. By the induction hypothesis, each C i is a disjoint union of cycles. These together with C provide a partition of E(G) into cycles. The following result is due to Toida [244]. Theorem 3.3 of u v paths. If W is a walk from vertex u to vertex v, then W contains an odd number Proof Let W be a walk which we consider as a graph in itself, and not as a subgraph of some other graph. Let u and v be initial and final vertices of the walk W. Clearly, d(u W) and d(v W) are odd, and d(w W) is even, for every w V(W) {u, v}. We count the number of distinct u v walks in W. These walks are the subgraphs of W. When we take a u v walk by successively selecting the edges e 1, e 2,..., e s, initial vertex of e 1 being u and terminal vertex of e s being v, for each edge there are an odd number of choices. The total number of such edges is the product of these odd numbers and is therefore odd. Now from these walks, we find the u v paths. If a u v walk W 1 is not a path, then it contains one or more cycles. The traversal of these cycles in the two possible alternative directions (clockwise and anticlockwise) produces in all an even number of walks, all with the same edge set as W 1. Omitting these even number of walks which are not paths from the total odd collection of u v walks, gives an odd number of u v paths. Toida [244] proved the necessity part and McKee [157] the sufficiency part of the next characterisation. The second proof of this result can be found in Fleischner [79], [80]. Theorem 3.4 A connected graph is Eulerian if and only if each of its edges lies on an odd number of cycles. Proof Necessity Let G be a connected Eulerian graph and let e = uv be any edge of G. Then G e is a u v walk W, and so G e = W contains an odd number of u v paths. Thus each of the odd number of u v paths in W together with e gives a cycle in G containing e and these are the only such cycles. Therefore there are an odd number of cycles in G containing e.

5 Graph Theory 63 Sufficiency Let G be a connected graph so that each of its edges lies on an odd number of cycles. Let v be any vertex of G and E v = {e 1,..., e d } be the set of edges of G incident on v, then E v = d(v) = d. For each i, 1 i d, let k i be the number of cycles of G containing e i. By hypothesis, each k i is odd. Let c(v) be the number of cycles of G containing v. Then d clearly c(v) = 1 2 k i implying that 2c(v) = d k i. Since 2c(v) is even and each k i is odd, d is i=1 i=1 even. Hence G is Eulerian. Corollary 3.1 graph is even. The number of edge disjoint paths between any two vertices of an Euler A consequence of Theorem 3.4 is the result of Bondy and Halberstam [37], which gives yet another characterisation of Eulerian graphs. A graph is Eulerian if and only if it has an odd number of cycle decom- Corollary 3.2 positions. Proof In one direction, the proof is trivial. If G has an odd number of cycle decompositions, then it has at least one, and hence G is Eulerian. Conversely, assume that G is Eulerian. Let e E(G) and let C 1,..., C r be the cycles containing e. By Theorem 3.4, r is odd. We proceed by induction on m = E(G), with G being Eulerian. If G is just a cycle, then the result is true. Now assume that G is not a cycle. This means that for each i, 1 i r, by the induction assumption, G i = G E(C i ) has an odd number, say s i, of cycle decompositions. (If G i is disconnected, apply the induction assumption to each of the nontrivial components of G i ). The union of each of these cycle decompositions of G i and C i yields a cycle decomposition of G. Hence the number of cycle decompositions of G containing C i is s i, 1 i r. Let s(g) denote the number of cycle decompositions of G. Then s(g) r s i r(mod 2) (since s i 1(mod 2)) i=1 1(mod 2). Two examples of Euler graphs are shown in Figure 3.5. Fig. 3.5

6 64 Eulerian and Hamiltonian Graphs 3.3 Unicursal Graphs An open walk that includes (or traces) all edges of a graph without retracing any edge is called a unicursal line or open Euler line. A connected graph that has a unicursal line is called a unicursal graph. Figure 3.6 shows a unicursal graph. Fig. 3.6 Clearly by adding an edge between the initial and final vertices of a unicursal line, we get an Euler line. The following characterisation of unicursal graphs can be easily derived from Theorem 3.1. Theorem 3.5 odd degree. A connected graph is unicursal if and only if it has exactly two vertices of Proof Let G be a connected graph and let G be unicursal. Then G has a unicursal line, say from u to v, where u and v are vertices of G. Join u and v to a new vertex w of G to get a graph H. Then H has an Euler line and therefore each vertex of H is of even degree. Now, by deleting the vertex w, the degree of vertices u and v each get reduced by one, so that u and v are of odd degree. Conversely, let u and v be the only vertices of G with odd degree. Join u and v to a new vertex w to get the graph H. So every vertex of H is of even degree and thus H is Eulerian. Therefore, G = H w has a u v unicursal line so that G is unicursal. The following result is the generalisation of Theorem 3.5. Theorem 3.6 In a connected graph G with exactly 2k odd vertices, there exists k edge disjoint subgraphs such that they together contain all edges of G and that each is a unicursal graph. Proof Let G be a connected graph with exactly 2k odd vertices. Let these odd vertices be named v 1, v 2,..., v k ; w 1, w 2,..., w k in any arbitrary order. Add k edges to G between the vertex pairs (v 1, w 1 ), (v 2, w 2 ),..., (v k, w k ) to form a new graph H, so that every vertex of H is of even degree. Therefore H contains an Euler line Z. Now, if we remove from Z the k edges we just added (no two of these edges are incident on the same vertex), then Z is divided into k walks, each of which is a unicursal line. The first removal gives a single unicursal line, the second removal divides that into two unicursal lines, and each successive removal divides a unicursal line into two unicursal lines, until there are k of them. Hence the result.

7 Graph Theory Arbitrarily Traceable Graphs An Eulerian graph G is said to be arbitrarily traceable (or randomly Eulerian) from a vertex v if every walk with initial vertex v can be extended to an Euler line of G. A graph is said to be arbitrarily traceable if it is arbitrarily traceable from every vertex (Fig. 3.7). Fig. 3.7 The following characterisation of arbitrarily traceable graphs is due to Ore [174]. Such graphs were also characterised by Chartrand and White [56]. Theorem 3.7 An Eulerian graph G is arbitrarily traceable from a vertex v if and only if every cycle of G passes through v. Proof Necessity Let the Eulerian graph G be arbitrarily traceable from a vertex v. Assume there is a cycle C not passing through v. Let H = G E(C). Then every vertex of H has an even degree and the component of H containing v is Eulerian. This component of H can be traversed as an Euler line Z, starting and ending with v and contains all those edges of G which are incident at v. Clearly, this v v walk cannot be extended to contain the edges of C also, contradicting that G contains v. Thus every cycle in G contains v. Sufficiency Let every cycle of the Eulerian graph G pass through the vertex v of G. We show that G is arbitrarily traceable from v. Assume, on the contrary, that G is not arbitrarily traceable from v. Then there is a v v closed walk W of G containing all the edges of G incident with v and yet not containing all the edges of G. Let one such edge be incident at a vertex u on W. So every vertex of H = G E(W) is of even degree and v is an isolated vertex of H and u is not. The component of H containing u is therefore Eulerian subgraph of G not passing through v, contradicting the assumption. Hence the result follows. Corollary 3.3 Cycles are the only arbitrarily traceable graphs.

8 66 Eulerian and Hamiltonian Graphs 3.5 Sub-Eulerian Graphs A graph G is said to be sub-eulerian if it is a spanning subgraph of some Eulerian graph. The following characterisation of sub-eulerian graphs is due to Boesch, Suffel and Tindell [28]. Theorem 3.8 A connected graph G is sub-eulerian if and only if G is not spanned by a complete bipartite graph. Proof Necessity We prove that no spanning supergraph H of an odd complete bipartite graph G is Eulerian. Let V 1 V 2 be the bipartition of the vertex set of G. Since degree of each vertex of G is odd, and G is complete bipartite, therefore V 1 and V 2 are odd. If H 1 is the induced subgraph of H on V 1, then at least one vertex, say v, of V 1 has even degree in H 1, since V 1 is odd. But then d(v H) = d(v H)+ V 2, which is odd. Therefore H is not Eulerian. Sufficiency Refer Boesch et. al., [28]. Super-Eulerian graphs A non-eulerian graph G is said to be super-eulerian if it has a spanning Eulerian subgraph. The following sufficient conditions for super-eulerian graphs are due to Lesniak-Foster and Williams [148]. Theorem 3.9 If a graph G is such that n 6, δ 2 and d(u)+d(v) n 1, for every pair of non-adjacent vertices u and v, then G is super-eulerian. The following result is due to Balakrishnan and Paulraja [12]. Theorem 3.10 If G is any connected graph and if each edge of G belongs to a triangle in G, then G has a spanning Eulerian subgraph. Proof Since G has a triangle, G has a closed walk. Let W be the longest closed walk in G. Then W must be a spanning Eulerian subgraph of G. If not, there exists a vertex v / W and v is adjacent to a vertex u of W. By hypothesis, uv belongs to a triangle, say uvw. If none of the edges of this triangle is in W, then W {uv, vw, wu} yields a closed walk longer than W (Fig. 3.8). If uw W, then (W uw) {uv, vw} would be a closed walk longer than W. This contradiction proves that W is a spanning closed walk in G.

9 Graph Theory 67 Fig Hamiltonian Graphs A cycle passing through all the vertices of a graph is called a Hamiltonian cycle. A graph containing a Hamiltonian cycle is called a Hamiltonian graph. A path passing through all the vertices of a graph is called a Hamiltonian path and a graph containing a Hamiltonian path is said to be traceable. Examples of Hamiltonian graphs are given in Figure 3.9. Fig. 3.9 If the last edge of a Hamiltonian cycle is dropped, we get a Hamiltonian path. However, a non-hamiltonian graph can have a Hamiltonian path, that is, Hamiltonian paths cannot always be used to form Hamiltonian cycles. For example, in Figure 3.10, G 1 has no Hamiltonian path, and so no Hamiltonian cycle; G 2 has the Hamiltonian path v 1 v 2 v 3 v 4, but has no Hamiltonian cycle, while G 3 has the Hamiltonian cycle v 1 v 2 v 3 v 4 v 1. Fig. 3.10

10 68 Eulerian and Hamiltonian Graphs Hamiltonian graphs are named after Sir William Hamilton, an Irish Mathematician ( ), who invented a puzzle, called the Icosian game, which he sold for 25 guineas to a game manufacturer in Dublin. The puzzle involved a dodecahedron on which each of the 20 vertices was labelled by the name of some capital city in the world. The aim of the game was to construct, using the edges of the dodecahedron a closed walk of all the cities which traversed each city exactly once, beginning and ending at the same city. In other words, one had essentially to form a Hamiltonian cycle in the graph corresponding to the dodecahedron. Figure 3.11 shows such a cycle. Fig Clearly, the n-cycle C n with n distinct vertices (and n edges) is Hamiltonian. Now, given any Hamiltonian graph G, the supergraph G (obtained by adding in new edges between non-adjacent vertices of G) is also Hamiltonian. This is because any Hamiltonian cycle in G is also a Hamiltonian cycle of G. For instance, K n is a supergraph of an n-cycle and so K n is Hamiltonian. A multigraph or general graph is Hamiltonian if and only if its underlying graph is Hamiltonian, because if G is Hamiltonian, then any Hamiltonian cycle in G remains a Hamiltonian cycle in the underlying graph of G. Conversely, if the underlying graph of a graph G is Hamiltonian, then G is also Hamiltonian. Let G be a graph with n vertices. Clearly, G is a subgraph of the complete graph K n. From G, we construct step by step supergraphs of G to get K n, by adding an edge at each step between two vertices that are not already adjacent (Fig. 3.12). Fig Now, let us start with a graph G which is not Hamiltonian. Since the final outcome of the procedure is the Hamiltonian graph K n, we change from a non-hamiltonian graph to a Hamiltonian graph at some stage of the procedure. For example, the non-hamiltonian

11 Graph Theory 69 graph G 1 above is followed by the Hamiltonian graph G 2. Since supergraphs of Hamiltonian graphs are Hamiltonian, once a Hamiltonian graph is reached in the procedure, all the subsequent supergraphs are Hamiltonian. Definition: A simple graph G is called maximal non-hamiltonian if it is not Hamiltonian and the addition of an edge between any two non-adjacent vertices of it forms a Hamiltonian graph. For example, G 1 above is maximal non-hamiltonian. Figure 3.13 shows a maximal non-hamiltonian graph. Fig It follows from the above procedure that any non-hamiltonian graph with n-vertices is a subgraph of a maximal non-hamiltonian graph with n vertices. The above procedure is used to prove the following sufficient conditions due to Dirac [68]. Theorem 3.11 (Dirac) If G is a graph with n vertices, where n 3 and d(v) n/2, for every vertex v of G, then G is Hamiltonian. Proof Assume that the result is not true. Then for some value n 3, there is a non- Hamiltonian graph H in which d(v) n/2, for every vertex of H. In any spanning super graph K (i.e., with the same vertex set) of H, d(v) n/2 for every vertex of K, since any proper supergraph of this form is obtained by adding more edges. Thus there is a maximal non-hamiltonian graph G with n vertices and d(v) n/2 for every v in G. Using this G, we obtain a contradiction. Clearly, G K n, as K n is Hamiltonian. Therefore there are non-adjacent vertices u and v in G. Let G + uv be the supergraph of G by adding an edge between u and v. Since G is maximal non-hamiltonian, G + uv is Hamiltonian. Also, if C is a Hamiltonian cycle of G + uv, then C contains the edge uv, since otherwise C is a Hamiltonian cycle of G, which is not possible. Let this Hamiltonian cycle C be u = v 1, v 2,..., v n = v, u. Now, let S = {v i C : there is an edge from u to v i+1 in G} and T = {v j C : there is an edge from v to v j in G}. Then v n / T, since otherwise there is an edge from v to v n = v, that is a loop, which is impossible.

12 70 Eulerian and Hamiltonian Graphs Also v n / S, (taking v n+1 as v 1 ), since otherwise we again get a loop from u to v 1 = u. Therefore, v n S T (Fig. 3.14). Fig Let S, T and S T be the number of elements in S, T and S T respectively. So S T < n. Also, for every edge incident with u, there corresponds one vertex v i in S. Therefore, S = d(u). Similarly, T = d(v). Now, if v k is a vertex belonging to both S and T, there is an edge e joining u to v k+1 and an edge f joining v to v k. This implies that C = v 1, v k+1, v k+2,..., v n, v k, v k 1,..., v 2, v 1 is a Hamiltonian cycle in G, which is a contradiction as G is non-hamiltonian. This shows that there is no vertex v k in S T, so that S T = Φ. Thus S T = S + T S T gives S + T = S T, so that d(u)+d(v) < n. This is a contradiction, because d(u) n/2 for all u in G, and so d(u)+ d(v) n/2+ n/2 giving d(u) + d(v) n. Hence the theorem follows. The following result is due to Ore [176]. Theorem 3.12 (Ore) Let G be a graph with n vertices and let u and v be non-adjacent vertices in G such that d(u)+d(v) n. Let G+uv denote the super graph of G obtained by joining u and v by an edge. Then G is Hamiltonian if and only if G+uv is Hamiltonian. Proof Let G be a graph with n vertices and suppose u and v are non-adjacent vertices in G such that d(u)+d(v) n. Let G+uv be the super graph of G obtained by adding the edge uv. Let G be Hamiltonian. Then obviously G + uv is Hamiltonian. Conversely, let G + uv be Hamiltonian. We have to show that G is Hamiltonian. Then, as in Theorem 3.11, we get d(u)+d(v) < n, which contradicts the hypothesis that d(u)+d(v) n. Hence G is Hamiltonian. The following is the proof of Bondy [35] of Theorem 3.12, and this proof bears a close resemblance to the proof of Dirac s theorem given by Newman [170], but is more direct. Proof (Bondy [35]) Consider the complete graph K on the vertex set of G in which the edges of G are coloured blue and the remaining edges of K are coloured red. Let C be a

13 Graph Theory 71 Hamiltonian cycle of K with as many blue edges as possible. We show that every edge of C is blue, in other words, that C is Hamiltonian cycle of G. Suppose to the contrary, C has a red edge uu (where u is the successor of u on C). Consider the set S of vertices joined to u by blue edges (that is, the set of neighbours of u in G). The successor u of u on C must be joined by a blue edge to some vertex v of S, because if u is adjacent in C only to vertices V (S U{u }), d G (u)+d G (u ) = N G (u) + N G (u ) S +( V S 1) = V(G) 1, contradicting the hypothesis that d G (u)+d G (u ) V(G), u and u being non-adjacent in G. But now the cycle C obtained from C by exchanging the edges uu and vv has more blue edges than C, which is a contradiction. Definition: Let G be a graph with n vertices. If there are two non-adjacent vertices u 1 and v 1 in G such that d(u 1 )+d(v 1 ) n, join u 1 and v 1 by an edge to form the super graph G 1. Now, if there are two non-adjacent vertices u 2 and v 2 in G 1 such that d(u 2 )+d(v 2 ) n, join u 2 and v 2 by an edge to form supergraph G 2. Continue in this way, recursively joining pairs of non-adjacent vertices whose degree sum is at least n until no such pair remains. The final supergraph thus obtained is called the closure of G and is denoted by c(g). The example in Figure 3.15 illustrates the closure operation. Fig We observe in this example that there are different choices of pairs of non-adjacent vertices u and v with d(u) + d(v) n. Therefore the closure procedure can be carried out in several different ways and each different way gives the same result. In the graph shown in Figure 3.16, n = 7 and d(u)+d(v) < 7, for any pair u, v of adjacent vertices. Therefore, c(g) = G. G Fig. 3.16

14 72 Eulerian and Hamiltonian Graphs The importance of c(g) is given in the following result due to Bondy and Chvatal [36]. Theorem 3.13 A graph G is Hamiltonian if and only if its closure c(g) is Hamiltonian. Proof Let c(g) be the closure of the graph G. Since c(g) is a supergraph of G, therefore, if G is Hamiltonian, then c(g) is also Hamiltonian. Conversely, let c(g) be Hamiltonian. Let G, G 1, G 2,..., G k 1, G k = c(g) be the sequence of graphs obtained by performing the closure procedure on G. Since c(g) = G k is obtained from G k 1 by setting G k = G k 1 + uv, where u, v is a pair of non adjacent vertices in G k 1 with d(u)+d(v) n, therefore it follows that G k 1 is Hamiltonian. Similarly G k 2, so G k 3,..., G 1 and thus G is Hamiltonian. Corollary 3.4 Hamiltonian. Let G be a graph with n vertices with n 3. If c(g) is complete, then G is There can be more than one Hamiltonian cycle in a given graph, but the interest lies in the edge-disjoint Hamiltonian cycles. The following result gives the number of edge-disjoint Hamiltonian cycles in a complete graph with odd number of vertices. Theorem 3.14 In a complete graph with n vertices there are (n 1)/2 edge-disjoint Hamiltonian cycles, if n is an odd number, n 3. Proof A complete graph G of n vertices has n(n 1)/2 edges and a Hamiltonian cycle in G contains n edges. Therefore the number of edge-disjoint Hamiltonian cycles in G cannot exceed (n 1)/2. When n is odd, we show there are (n 1)/2 edge-disjoint Hamiltonian cycles. The subgraph of a complete graph with n vertices shown in Figure 3.17 is a Hamiltonian cycle. Keeping the vertices fixed on a circle, rotate the polygonal pattern clockwise by n 3 n 1, 2. n 1,..., n 1 degrees. We see that each rotation produces a Hamiltonian cycle that has no edge in common with any of the previous ones. Therefore, there are (n 3)/2 new Hamiltonian cycles, all disjoint from the one in Figure 3.17, and also edge-disjoint among themselves. Thus there are (n 1)/2 edge disjoint Hamiltonian cycles. Fig. 3.17

15 Graph Theory 73 The next result involving degrees give the sufficient conditions for a graph to be Hamiltonian. Theorem 3.15 Let D =[d i ] n 1 be a degree sequence of a graph G = (V, E), d 1 d 2... d n. Each of the following gives the sufficient conditions for G to be Hamiltonian. A. 1 k n d k n (Dirac [68]) 2 B. uv / E d(u)+d(v) n (Ore [176]) C. 1 k n 2 d k > k (Posa [210]). D. j < k, d j j and d k k 1 d j + d k n (Bondy [33]) E. d k k < n 2 d n k n k (Chvatal [59]) F. For every i and j with 1 i n, 1 j n, i + j n, v i v j / E, d(v i ) i and d(v j ) j 1 d(v i )+d(v j ) n (Las Vergnas [256]. G. c(g) is complete (Bondy and Chvatal [36]). Proof We first prove that A (i) B (ii) C (iii) D (iv) E (v) F (vi) G. i. This can be easily established. ii. Assume that (C) is not true, so that there exists a k with 1 k < n 2 and d k k. Then the induced subgraph on the vertices v 1, v 2,..., v k is a complete graph. For, if there are vertices i and j with 1 i < j k and v i v j / E, then d i +d j 2d k < n, contradicting (B). Since d k k, each v i, 1 i k, is adjacent to at most one v j, k+ 1 j n. Also, n k > k, because k < n 2. Therefore there is a vertex v j, k + 1 j n not adjacent to any of the vertices v 1, v 2,..., v k. For this v j, we have d j n k 1. But then d j +d k (n k 1)+k = n 1. Thus there is a v j v k / E with d j + d k n 1, contradicting (B). Hence proving (ii). iii. Assume that (D) is not true, so that there exist j and k with j < k, d j j, d k k 1 and d j + d k < n. This gives i = d j < n 2. But then d j j gives d d j d j, since the sequence is non-decreasing. Therefore, d i d j = i. Thus there is an i, 1 i n 2 with d i i, contradicting (C). This proves (iii). iv. If (E) is not true, there is a k with d k k < n 2 and d n k n k 1. Then d k +d n k n 1. Setting n k = j, we have k < j, d k k, d j j 1 and d j +d k n 1. This contradicts (D) and so (iv) is proved. v. Assume that (F) is not true, so that there is a pair of vertices v i and v j, i < j with v i v j / E and violating (F). Choose i to be the least such possible integer. Then by minimality of i, d i 1 > i 1. Thus d i d i 1 i and since d i i, we obtain d i = i. If

16 74 Eulerian and Hamiltonian Graphs i n 2, we get d i + d j 2d i n, contradicting the violation of (F). Therefore, i < n 2. Thus there is an i, 1 i < n 2 with d i = i. Now, if (E) is satisfied, we have d n i n i and since j n i, we obtain d j d n i n i. By minimality of i, d i = i and we have d j + d i (n i)+i = n, again contradicting the violation of (F). Thus negation of (F) implies negation of (E) and (V) is established. vi. Assume that c(g) = H is not complete. Let v i and v j be non-adjacent vertices in H such that (a) j is as large as possible and (b) i is as large as possible subject to (a). Then i < j, and since H is the closure of G, therefore d(v i H)+d(v j H) n 1, (3.15.1) d(v i G)+d(v j G) n 1. By the choice of j, v i is adjacent in H to all v k with k > j, so that d(v i H) n j. (3.15.2) Again, by the choice of i, v j is adjacent in H to all v k with k > i, k j, so that d(v j H) n i 1. (3.15.3) From (3.15.1) and (3.15.2), we have d(v j G) d(v j H) (n 1) (n j) = j 1. From (3.15.1) and (3.15.3), we have d(v j G) d(v i H) (n 1) (n i 1)= i. From (3.15.2) and (3.15.3), we have i+ j (2n 1) d(v i H) d(v j H) n. (using (1)) Therefore i and j contradict the given conditions. Thus H = c(g) is complete. This proves (vi). By Theorem 3.13 it follows that if (G) holds, then G is Hamiltonian. The next result is due to Nash-Williams [168]. Every k-regular graph on 2k + 1 vertices is Hamilto- Theorem 3.16 (Nash-Williams) nian. Proof Let G be a k-regular graph on 2k + 1 vertices. Add a new vertex w and join it by an edge to each vertex of G. The resulting graph H on 2k+ 2 vertices has δ = k + 1. Thus by Theorem 3.15 (A), H is Hamiltonian. Removing w from H, we get a Hamiltonian path, say v 0 v 1...v 2k.

17 Graph Theory 75 Assume that G is not Hamiltonian, so that (a) if v 0 v i E, then v i 1 v 2k / E, (b) if v 0 v i / E, then v i 1 v 2k E, since d(v 0 ) = d(v 2k ) = k. The following cases arise. Case (i) v 0 is adjacent to v 1, v 2,..., v k, and v 2k is adjacent to v k, v k+1,..., v 2k 1. Then there is an i with 1 i k such that v i is not adjacent to some v j for 0 j k( j i). But d(v i ) = k. So v i is adjacent to v j for some j with k+ 1 j 2k 1. Then the cycle C given by v i v i 1...v 0 v i+1...v j 1 v 2k v 2k+1...v j is a Hamiltonian cycle of G (Fig 3.18). Fig Case (ii) There is an i with 1 i 2k 1 such that v i+1 v 0 E, but v i v 0 / E. Then by (b), v i 1 v 2k E. Thus G contains the 2k-cycle v i 1 v i 2...v 0 v i+1. Renaming the 2k-cycle C as u 1 u 2...u 2k and let u 0 be the vertex of G not on C. Then u 0 cannot be adjacent to two consecutive vertices on C and hence u 0 is adjacent to every second vertex on C, say u 1, u 3,..., u 2k 1. Replacing u 2i by u 0, we obtain another maximum cycle C of G and hence u 2i must be adjacent to u 1, u 3,..., u 2k 1. But then u 1 is adjacent to u 0, u 2,..., u 2k, implying d(u 1 ) k+1. This is a contradiction and hence G is Hamiltonian. 3.7 Pancyclic Graphs Definition: A graph G of order n( 3) is pancyclic if G contains all cycles of lengths from 3 to n. G is called vertex-pancyclic if each vertex v of G belongs to a cycle of every length l, 3 l n.

18 76 Eulerian and Hamiltonian Graphs Example Clearly, a vertex-pancyclic graph is pancyclic. However, the converse is not true. Figure 3.19 displays a pancyclic graph that is not vertex-pancyclic. Fig The result of pancyclic graphs was initiated by Bondy [34], who showed that Ore s sufficient condition for a graph G to be Hamiltonian (Theorem 6.2.5) actually implies much more. Note that if δ n 2, then m n2 2. The proof of the following result due to Thomassen can be found in Bollobas [29]. [ ] Theorem 3.17 Let G be a simple Hamiltonian graph on n vertices with at least n 2 2 edges. Then G is either pancyclic or else is the complete bipartite graph K n 2, n. In particular, 2 if G is Hamiltonian and m > n2 4, then G is pancyclic. Proof The result can easily be verified for n = 3. We may therefore assume that n 4. We apply induction on n. Suppose the result is true for all graphs of order at most n 1(n 4), and let G be a graph of order n. First, assume that G has a cycle C = v 0 v 1...v n 2 v 0 of length n 1. Let v be the (unique) vertex of G not belonging to C. If d(v) n 2, v is adjacent to two consecutive vertices on C and hence G has a cycle of length 3. Suppose for some r, 2 r n 1 2, C has no pair of vertices u and w on C adjacent to v in G with d C (u, w) = r. Then if v i1, v i2,...v id(v) are the vertices of C that are adjacent to v in G (recall that C contains all the vertices of G except v), then v i1 +r, v i2 +r,..., v id(v) +r are nonadjacent to v in G, where the suffixes are taken modulo (n 1). Thus, 2d(v) n 1, a contradiction. Hence, for each r, 2 r n 1 2, C has a pair of vertices u and w on C adjacent to v in G with d C (u, w) = r. Thus for each r, 2 r n 1 2, G has a cycle of length r + 2 as well as a cycle of length n 1 r + 2 = n r + 1 (Fig. 3.20). Thus G is pancyclic. Fig. 3.20

19 Graph Theory 77 If d(v) n 1 n2 2, then G[V(C)], the subgraph of G induced by V(C) has at least 4 n 1 2 > (n 1) 2 4 edges. So, by the induction assumption, G[V(C)] is pancyclic and hence G is pancyclic. (By hypothesis, G is Hamiltonian). Next, assume that G has no cycle of length n 1. Then G is not pancyclic. In this case, we show that G is K n 2, n. 2 Let C = v 0 v 1 v 2...v n 1 v 0 be a Hamilton cycle of G. We claim that of the two pairs v i v k and v i+1 v k+2 (where suffixes are taken modulo n), at most only one of them can be an edge of G. Otherwise, v k v k 1 v k 2...v i+1 v k+2 v k+3 v k+4...v i v k is an (n 1)-cycle in G, a contradiction. Hence, if d(v i ) = r, then there are r vertices adjacent to v i in G and hence at least r vertices (including v i+1 since v i v i 1 E(G)) that are nonadjacent to v i+1. Thus, d(v i+1 ) n r and d(v i )+d(v i+1 ) n. Summing the last inequality over i from 0 to n 1, we get 4m n 2. But by hypothesis, 4m n 2. Hence, m = n2 4 and so n must be even. This gives d(v i )+d(v i+1 ) = n for each i, and thus for each i and k, exactly one of v i v k and v i+1 v k+2 is an edge of G. (3.17.1) Thus, if G K n 2, n 2, then certainly there exist i and j such that v i v j E and i j (mod 2). Hence for some j, there exists an even positive integer s such that v j+1 v j+1+s E. Choose s to be the least even positive integer with the above property. Then v j v j+1+s / E. Hence, s 4 (as s= 2 would mean that v j v j+1 / E). Again, by (3.17.1), v j 1 v j+s 3 = v j 1 v j 1+(s 2) E(G) contradicting the choice of s. Thus, G = K n 2, 2 n. The last part follows from the fact that E(K n 2, n n2,) = 2 4. Theorem 3.18 Let G K n 2, n, be a simple graph with n 3 vertices and let d(u)+d(v) n 2 for every pair of non-adjacent vertices of G. Then G is pancyclic. Proof By Ore s Theorem (Theorem 3.12), G is Hamiltonian. We show that G is pancyclic by first proving that m n2 4 and then invoking Theorem This is true if δ n 2 (as 2m = n d i δ n n 2 /2). So assume that δ < n 2. i=1 Let S be the set of vertices of degree δ in G. For every pair (u, v) of vertices of degree δ, d(u)+d(v) < 2 n + n 2 = n. Hence by hypothesis, S induces a clique of G and S δ + 1. If S = δ + 1, then G is disconnected with G[S] as a component, which is impossible (as G is Hamiltonian). Thus, S δ. Further, if v S, v is nonadjacent to n 1 δ vertices of G. If u is such a vertex, d(v)+d(u) n implies that d(u) n δ. Further, v is adjacent to at least one vertex w / S and d(w) δ + 1, by the choice of S. These facts give that 2m = n i=1 d i (n δ 1)(n δ)+δ 2 +(δ + 1), where the last (δ + 1) comes out of the degree of w. Thus, 2m n 2 n(2δ + 1)+2δ 2 + 2δ + 1,

20 78 Eulerian and Hamiltonian Graphs which implies that 4m 2n 2 2n(2δ + 1)+4δ 2 + 4δ + 2 = (n (2δ + 1) 2 + n n 2 + 1, since n > 2δ. Consequently, m > n2, and by Theorem 3.17, G is pancyclic Exercises 1. Prove that the wheel W n is Hamiltonian for every n 2, and n-cube Q n is Hamiltonian for each n If G is a k-regular graph with 2k 1 vertices, then prove that G is Hamiltonian. 3. Show that if a cubic graph G has a spanning closed walk, then G is Hamiltonian. 4. If G = G(X, Y) is a bipartite Hamiltonian graph, then show that X = Y. 5. Prove that for each n 1, the complete tripartite graph K n, 2n, 3n is Hamiltonian, but K n, 2n, 3n+1 is not Hamiltonian. 6. How many spanning cycles are there in the complete bipartite graphs K 3, 3 and K 4, 3? 7. Prove that a graph G with n 3 vertices is arbitrarily traceable if and only if it is one of the graphs C n, K n or K n, n with n = 2p. 8. Prove that a graph G with n 3 vertices is randomly traceable if and only if it is randomly Hamiltonian. 9. Find the closure of the graph given in Figure 3.2. Is it Hamiltonian? 10. Does there exist an Eulerian graph with i. an even number of vertices and an odd number of edges, ii. and odd number of vertices and an even number of edges. Draw such a graph if it exists. 11. Characterise graphs which are both Eulerian and Hamiltonian. 12. Characterise graphs which possess Hamiltonian paths but not Hamiltonian cycles. 13. Characterise graphs which are unicursal but not Eulerian. 14. Give an example of a graph which is neither pancyclic nor bipartite, but whose n- closure is complete.

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### 7. Colourings. 7.1 Vertex colouring

7. Colourings Colouring is one of the important branches of graph theory and has attracted the attention of almost all graph theorists, mainly because of the four colour theorem, the details of which can

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### (a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from

4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with

### 1 Basic Definitions and Concepts in Graph Theory

CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered

### Chapter 6 Planarity. Section 6.1 Euler s Formula

Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities

### HOMEWORK #3 SOLUTIONS - MATH 3260

HOMEWORK #3 SOLUTIONS - MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not

### Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn

### The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson)

Chapter 11 Graph Theory The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson) (N. Let us start with a formal definition of what is a graph. Definition 72. A graph

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Chapter 2. Basic Terminology and Preliminaries

Chapter 2 Basic Terminology and Preliminaries 6 Chapter 2. Basic Terminology and Preliminaries 7 2.1 Introduction This chapter is intended to provide all the fundamental terminology and notations which

### Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.

Mária Markošová Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials.

### COLORED GRAPHS AND THEIR PROPERTIES

COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring

### 6. Planarity. Fig Fig. 6.2

6. Planarity Let G(V, E) be a graph with V = {v 1, v 2,..., v n } and E = {e 1, e 2,..., e m }. Let S be any surface (like the plane, sphere) and P = {p 1, p 2,..., p n } be a set of n distinct points

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest.

2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).

### Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

### Chapter 8 Independence

Chapter 8 Independence Section 8.1 Vertex Independence and Coverings Next, we consider a problem that strikes close to home for us all, final exams. At the end of each term, students are required to take

### 1. Relevant standard graph theory

Color identical pairs in 4-chromatic graphs Asbjørn Brændeland I argue that, given a 4-chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4-coloring

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Connections between decomposition trees of 3-connected plane triangulations and hamiltonian properties

Introduction Hamiltonicity Other hamiltonian properties Connections between decomposition trees of 3-connected plane triangulations and hamiltonian properties Gunnar Brinkmann Jasper Souffriau Nico Van

### Chapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

9 Properties of Trees. Definitions: Chapter 4: Trees forest - a graph that contains no cycles tree - a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

### 1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if

Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these

### CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph

Today s Topics: CSE 0: Discrete Mathematics for Computer Science Prof. Miles Jones. Graphs. Some theorems on graphs. Eulerian graphs Graphs! Model relations between pairs of objects The Internet graph!

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input

### Chapter 6: Colouring Graphs

17 Coloring Vertices Chapter 6: Colouring Graphs 1. Sections 17-19: Qualitative (Can we color a graph with given colors?) Section 20: Quantitative (How many ways can the coloring be done?) 2. Definitions:

### A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

### Coloring Eulerian triangulations of the projective plane

Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A simple characterization

### Characterizations of Arboricity of Graphs

Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### Chapter 4. Trees. 4.1 Basics

Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.

### Unicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield - Simmons Index

Filomat 28:3 (2014), 451 461 DOI 10.2298/FIL1403451H Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Unicyclic Graphs with Given Number

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### 14. Trees and Their Properties

14. Trees and Their Properties This is the first of a few articles in which we shall study a special and important family of graphs, called trees, discuss their properties and introduce some of their applications.

### Generalizing the Ramsey Problem through Diameter

Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive

### UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### M-Degrees of Quadrangle-Free Planar Graphs

M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru

### On Total Domination in Graphs

University of Houston - Downtown Senior Project - Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### 9.1. Vertex colouring. 9. Graph colouring. Vertex colouring.

Vertex colouring. 9. Graph colouring k-vertex-critical graphs Approximation algorithms Upper bounds for the vertex chromatic number Brooks Theorem and Hajós Conjecture Chromatic Polynomials Colouring of

### Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics

### On a tree graph dened by a set of cycles

Discrete Mathematics 271 (2003) 303 310 www.elsevier.com/locate/disc Note On a tree graph dened by a set of cycles Xueliang Li a,vctor Neumann-Lara b, Eduardo Rivera-Campo c;1 a Center for Combinatorics,

### Graph Theory. Euler tours and Chinese postmen. John Quinn. Week 5

Graph Theory Euler tours and Chinese postmen John Quinn Week 5 Recap: connectivity Connectivity and edge-connectivity of a graph Blocks Kruskal s algorithm Königsberg, Prussia The Seven Bridges of Königsberg

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### SAMPLES OF HIGHER RATED WRITING: LAB 5

SAMPLES OF HIGHER RATED WRITING: LAB 5 1. Task Description Lab report 5. (April 14) Graph Coloring. Following the guidelines, and keeping in mind the assessment criteria, using where appropriate experimental

### Intersection Dimension and Maximum Degree

Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai - 600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show

### A simple existence criterion for normal spanning trees in infinite graphs

1 A simple existence criterion for normal spanning trees in infinite graphs Reinhard Diestel Halin proved in 1978 that there exists a normal spanning tree in every connected graph G that satisfies the

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Chapter 2 Paths and Searching

Chapter 2 Paths and Searching Section 2.1 Distance Almost every day you face a problem: You must leave your home and go to school. If you are like me, you are usually a little late, so you want to take

### On parsimonious edge-colouring of graphs with maximum degree three

On parsimonious edge-colouring of graphs with maximum degree three Jean-Luc Fouquet, Jean-Marie Vanherpe To cite this version: Jean-Luc Fouquet, Jean-Marie Vanherpe. On parsimonious edge-colouring of graphs

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Section Summary. Introduction to Graphs Graph Taxonomy Graph Models

Chapter 10 Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity Euler and Hamiltonian Graphs Shortest-Path Problems

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### 2-partition-transitive tournaments

-partition-transitive tournaments Barry Guiduli András Gyárfás Stéphan Thomassé Peter Weidl Abstract Given a tournament score sequence s 1 s s n, we prove that there exists a tournament T on vertex set

### Planar Graph and Trees

Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### Homework 15 Solutions

PROBLEM ONE (Trees) Homework 15 Solutions 1. Recall the definition of a tree: a tree is a connected, undirected graph which has no cycles. Which of the following definitions are equivalent to this definition

### Non-Separable Detachments of Graphs

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### Minimum degree condition forcing complete graph immersion

Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### A threshold for the Maker-Breaker clique game

A threshold for the Maker-Breaker clique game Tobias Müller Miloš Stojaković October 7, 01 Abstract We study the Maker-Breaker k-clique game played on the edge set of the random graph G(n, p. In this game,

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### Chapter 6: Graph Theory

Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average