Some Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.

Size: px
Start display at page:

Download "Some Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour."

Transcription

1 Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function f : E(G) { 1, +1} is said to be a signed star dominating function of G if e E G (v) f(e) 1, for every v V (G), where E G (v) = {uv E(G) u V (G)}. The minimum of the values of e E(G) f(e), taken over all signed star dominating functions f on G is called the signed star domination number of G and is denoted by γ ss (G). In this paper we show that if G is a connected graph of order n containing a 2-factor and G K 5, then γ ss (G) 7n 6. Among other results it is shown that if G is connected and α(g) 2, then γ ss (G) n + 1, where α(g) is the independence number of G. 1. Introduction Let G be a graph with the vertex set V (G) and the edge set E(G). The order and size of G denote the number of vertices and the number of edges of G, respectively. We denote the minimum degree of the vertices of G by δ(g). For every subset U V (G), we denote the induce subgraph on U by U. Let N(v) denote the neighbour set of v. The complete graph and the cycle of order n, are denoted by K n and C n, respectively. A Hamilton cycle is a cycle in a graph that visits each vertex exactly once. A walk is a sequence v 0, e 1, v 1,..., e k, v k of vertices and edges such that, for 1 i k, the edge Key Words: Signed Star Domination Number, 2-factor, Independence Number 2010 Mathematics Subject Classification: 05C69, 05C78 1

2 e i has endpoints v i 1 and v i. A trail is a walk with no repeated edge. An even trail is a trail with even number of edges. An Eulerian trail is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian trail which starts and ends on the same vertex. A 2-factor is a disjoint union of finitely many cycles that cover all vertices of G. A graph whose each vertex has even degree is called even graph. The independence number for a given graph G is the size of maximum independent set of G and is denoted by α(g). Here κ(g) denotes the vertex connectivity of the graph G. We define the value of the edge e by f(e), for every e E(G) and S G (v) = u N(v) f(uv), for every v V (G). Also ω(g) stands for e E(G) f(e). A function f : E(G) { 1, 1}, is said to be a signed star dominating function of G if S G (v) 1, for every v V (G). The minimum value of ω(g), taken over all signed star dominating functions f on G, is called the signed star domination number of G and is denoted by γ ss (G). The signed star dominating function (SSDF) was introduced by Xu in [?]. Several authors have been studied the signed star dominating function (SSDF) and obtained the following bounds. It was proved in [?], for all graphs G of order n without isolated vertices, γ ss (G) n 2. Furthermore, for every graph G of order n 4, γ ss (G) 2n 4, and this bound is sharp. In this paper first we prove that for every graph G of order n, if δ(g) n 2, then γ ss (G) n + 1. Then we show that for a connected graph G (G K 5 ) if G has a 2-factor, then γ ss (G) 7n 6 and the upper bound is sharp. Finally for a connected graph G of order n, and α(g) 2, we prove that γ ss (G) n + 1. The following interesting theorem was proved in [?]. Theorem 1. For every natural number n, the following holds: n 2 if n 0 (mod 2) γ ss (K n ) = n + 1 if n 1 (mod 4) n if n 3 (mod 4). 2. An upper bound for the signed star domination number 2

3 of graphs containing a 2-factor In this section we would like to provide an upper bound for the signed star domination number of graphs containing a 2-factor. Before stating the proof of the main result the following lemma is needed. Lemma 1. Let G be a connected graph. Then there exists f : E(G) { 1, +1} such that for every v V (G), S G (v) 1 and ω(g) 1. Furthermore, if there is no function f with the mentioned property and ω(g) 0, then G is an even graph of odd size. Therefore, if G has a vertex of odd degree, then there exists a function f with the desired property and ω(g) 0. Proof. First add a new vertex u to G and join u to all vertices of odd degree in G. Call this graph by G. Clearly, every vertex of G has an even degree. Therefore, G contains an Eulerian circuit C. If G has at least one vertex of odd degree, then one can assume that u is the starting point of C. Otherwise, choose an arbitrary vertex of G as the starting point. Assign alternatively +1, 1 to all edges of C, starting by +1. Now, for every v V (G), S G (v) = 0. After removing u in G we have S G (v) 1, for every v V (G). Two cases can be considered: Case (i) C has an even number of edges. In this case the sum of all values of edges of C is zero. Since S G (u) = 0, after removing u, we find that ω(g) = 0. Case (ii) C has an odd number of edges. Hence, if G is an even graph, then ω(g) = +1. Otherwise, ω(g) = 1, since the value of the first edge of C is started by +1. Hence for each case we have, ω(g) 1 and the proof is complete. Theorem 2. Let G be a graph of order n such that δ(g) n 2. Then γ ss(g) n + 1. Proof. If n 4 the proof of the theorem is straightforward. Thus, assume that n 5. By Theorem of [?], G has a Hamilton cycle C. 3

4 Let G = G \ E(C). Let C 1,..., C r be the connected components of G. By Lemma??, there is an edge assignment f : E(G) { 1, +1} such that for every C i, ω(c i ) 1, and for each v V (C i ), S Ci (v) 1 and ω(c i ) has minimum possible value. Now, we extend f to E(G) by assigning +1 to every edge of C. Let T = {C i ω(c i ) = 1}. If T 1, then we are done. Otherwise, We know that δ(g ) n 2 2. Thus the order of each component is at least n 2 1. Then we have: r( n 1) n. 2 Since we have n 5, it is easily seen that: r 2 which implies that T 2, except when n = 6 and G is a union of one Hamilton cycle and a perfect matching which are edge disjoint. In this case if we assign +1 to all edges of the Hamilton cycle and 1 to the perfect matching edges, the Theorem 2 is proved. Thus assume T = 2. By Lemma??, every vertex of C i has even degree and also C i has odd size, for every C i T. Now, let e = uv E(C), u V (C 1 ) and v V (C 2 ). One can change f(e) from +1 to 1. Now, consider two Eulerian circuits for C 1 and C 2 and reassign the values of the edges of these two Eulerian circuits by +1 and 1 consecutively, starting from u and v with value +1. Hence, S G (z) 1, for every z V (G). Moreover, we find that ω(g) n = n and the proof is complete. Lemma 2. For every connected even graph G, one can remove all edges of finitely many even closed trails( even trail: a trail with even number of edges) such that the remaining graph is a union of some isolated vertices and at most one odd cycle. Proof. If G has an even size, then it is an even closed trail and in this case the lemma is proved. Otherwise, let T be an Eulerian circuit of odd size in G. Traverse T from an arbitrary vertex w. Let C be the first cycle in our traverse. If C is an odd cycle, then we can remove C from G such that the resultant graph is an even closed trail. In this case, we are done. Otherwise, if C is an even cycle, remove C from G. The resultant graph has at most one component which its order is at least 2 and every vertex has an even degree. By induction on E(G) this component can be partitioned into at most one odd cycle and some even closed trails. Hence, the proof is complete. 4

5 Theorem 3. Let G K 5 be a connected graph of order n. If G has a 2-factor, then γ ss (G) 7n 6. Moreover, the upper bound is sharp. Proof. If V (G) 5, the proof is straightforward. Thus, assume that V (G) 6. Let F be a 2-factor of G. Assign +1 to all edges of F and let G 1 = G \ F. First, consider those components of G 1 which have at least a vertex of odd degree. Let C be one of these components. By Lemma??, one can assign +1 and 1 to the edges of C such that for every v V (C), S C (v) 1 and ω(c) 0. By considering the values of the edges of F we conclude that S G (v) +1, for every v V (C). Now, consider all even connected components of G 1, say Z 1,..., Z k. By Lemma??, one can remove a set of even closed trails of each Z i, say T i, such that each even component of the remaining graph, G 2, is either an odd cycle or an isolated vertex. For every T T i, 1 i k, we consecutively assign +1 and 1 to the edges of T. This implies that ω(t ) = 0. Now, we would like to determine the values of edges of the remaining odd cycles in G 2. Let C 1,..., C l be these odd cycles. For every C i with V (C i ) 5, we apply the following algorithm: If there are four vertices a, b, c and d such that ac, cd, bd E(C i ) and ab / F, then join a to b and remove ac, cd and db. Call the new graph by G 2. We claim that for every edge assignment of G 2, there is an edge assignment for G 2 where ω(g 2 ) = ω(g 2 ) and S G 2 (v) = S G 2 (v), for every v V (G 2 ). To see this, let f be an edge assignment for G 2. Then the following hold: 1. If f(ab) = 1 in G 2, then define f(ac) = f(bd) = 1 and f(cd) = 1 in G If f(ab) = 1 in G 2, then define f(ac) = f(bd) = 1 and f(cd) = 1 in G 2. For every remaining edge e G 2, define the value of e equal to f(e) in G 2. Clearly, ω(g 2 ) = ω(g 2 ) and S G 2 (v) = S G 2 (v) for every v V (G 2 ). Hence the claim is proved. By this algorithm, the length of an odd cycle such as C i is decreased by 2. Continue this 5

6 algorithm until there is no cycle which can be replaced with a shorter one. At this step, for every C i, if s and t are two vertices on C i with a path of length 3 on C i, then one can see that st F. Now, let C i have length 2m+1(m > 1). Two cases may be considered: Case 1. The cycle C i has been obtained from a cycle of length 2m + 3 (m > 1), say C i. We claim that cycle C i shorten too. could be shorten in such a way that the resultant cycle can be Let {v 1 v 2, v 2 v 3,..., v 2m+3 v 1 } be the edges of C i. Let v 1v 4 be that edge whose adding to C i makes the cycle C i. Since C i cannot be shorten, we conclude that v 5 v 8, v 5 v 2m+3 F and so v 2 v 5 / F. Two vertices adjacent to v 7 in F is contained in C i. Thus, v 2 v 7 / F. Hence, if we add v 2 v 5 instead of v 1 v 4 to obtain a cycle of length 2m + 1, then the resultant cycle can be shorten via the edge v 2 v 7. So the claim is proved. Therefore, we can assume that if we apply the algorithm on C i, then we can reduce C i to a triangle. Case 2. C i is a cycle obtained by the removing of some even closed trails from a connected component of G 1 containing vertices of C i. Let T Ci be the set of these even trails. If V (C i ) = V (G), then we alternatively assign +1 and 1 to the edges of C i starting by +1. By this assignment we obtain an SSDF for G whose ω(g) is ω(f ) + ω(c i ) = n + 1. Hence, V (G) 6 implies that n + 1 7n 6 and in this case the theorem is proved. Thus, we can assume that V (C i ) V (G). If V (C i ) 5, then let U Ci denote the set of all isolated vertices obtaining after removing all edges of the elements of T Ci. There is no edge with one end point in C i and another one in V (G) \ (V (C i ) U Ci ). Hence, U Ci > 0. For every triangle, say C i, define U Ci =. Therefore, V (C i ) 5 implies that the Case 1 does not occur for C i. By the definition of U Ci and U Cj, we have U Ci U Cj =, for every i j. We say that C i and C j are friend if i j and there exists some edge in F, say e, with one end point in V (C i ) U Ci and another one in V (C j ) U Cj. Now, let L be the set of all odd cycles remaining after finishing the algorithm. We provide an algorithm on L. In each step, consider two cycles C i and C j which are friend, and let w i w j F, where w i 6

7 V (C i ) U Ci and w j V (C j ) U Cj. Obviously, ( T T Ci T ) C i and ( T T Cj T ) C j are odd closed trails. Change the value of w i w j from +1 to 1 and assign alternatively +1 and 1 to all edges of ( T T Ci T ) C i starting from w i with +1. Do the same for ( T T Cj T ) C j starting from w j. Then remove C i and C j from L. Since the value of w i w j is changed from +1 to 1 and the sum of all values of the edges in ω(( T (T Ci T Cj ) T ) C i C j ) is 2, we conclude that for every v U Ci V (C i ) U Cj V (C j ), S G (v) 1. We continue this algorithm until we cannot find any two cycles in L which are friend. Assume that L is the set of remaining cycles of L. Consider a set of vertices S with this property that if V (C i ) 5, then S U Ci = 1, for i = 1,..., L. Now, define W = ( L i=1 V (C i)) S. Let W = V (G) \ W and t be the number of triangles in L. Let h = L t. We note that W contains 3t vertices of triangles. Since for every C i L, with V (C i ) 5, we have W U Ci = 1, W 3t+6h. Since W + W = n, we find that W + 3t + 6h n. (1) Now, we count the number of edges in F with one end point in W and the other one in W. Let q be the number of such edges. Since the degree of each vertex in F is 2, we find that q 2 W. Clearly, there is no edge in F with one endpoint in the vertex set of a triangle in L and another endpoint in W, since otherwise this triangle is a friend of another cycle in L and we could continue the algorithm. Moreover, for every cycle of length at least 5 in L, say C i, the vertex u Ci S U Ci. We claim that two edges in F incident with u Ci have other endpoints in W. To see this we note that by assumption, every edge in F which meet V (C i )( V (C i ) 5), have two endpoints in V (C i ). Furthermore, if other end point of these edges are in W \ V (C i ), then C i is a friend of another cycle in L, a contradiction. Therefore, the claim is proved. This implies that: 2(3t) + 2h q, q 2 W. (2) Thus, 3t + h W and so 6t + 7h n by (??). This yields that t + h n 6. Now, we claim that γ ss (G) n + t + h. 7

8 Let M be the induced subgraph on all edges of G \ C i L E(C i). Then ω(m) n. Now, it suffices for every cycle in L, such as C i, we assign +1 and 1, alternatively to the edges of C i starting with +1. Thus, ω(c i ) = +1. Finally, we obtain an SSDF for G with the following property: ω(g) n + t + h 7n 6, which implies that γ ss (G) 7n 6. Now, we would like to show that the upper bound is sharp. To see this for every positive integer k consider the cycle C 6k. Let V (C 6k ) = {v 1,..., v 6k }. We partition the vertices of even indices into k subsets, each of them containing 3 vertices as follows: T i = {v 6i+2, v 6i+4, v 6i+6 }, for every i, 0 i k 1. Join 3 vertices of each subset, to obtain k triangles. Call this graph by G. We claim that for every SSDF of G, say f, we have ω(g) 7n 6. Clearly, two edges incident with a vertex of degree 2 (odd indices) have value 1. Obviously, for each vertex v of degree 4, at least 3 edges incident with v should have value +1. Thus for every triangle obtained by T i, at least two edges have value +1. This yields that ω(g) 6k + k = 7k. Thus γ ss (G) = 7n 6. The graph shown in Figure 1 is a graph of order 12 with γ ss (G) = = 14. v 1. v 2 v 12 v 3 v 11 v 4 v 10 v 5 v 9 v 6 v 8 v 7 8

9 Figure 1: Graph G with γ ss (G) = 7n An upper bound for signed star domination number of graphs with independence number at most 2 Let G be a graph. In this section we prove that if the independence number of G is at most 2, then the signed star domination number of G is at most n + 1. Theorem 4. Let G be a connected graph of order n and α(g) 2. Then γ ss (G) n + 1. Proof. We divide the proof into two parts: (i) First assume that G has no cut vertex. Thus, κ(g) 2 and so κ(g) α(g). Thus by Proposition of [?], G is Hamiltonian. Let C be a Hamilton cycle of G. Remove all edges of C from G and call the resultant graph by G. Let C 1,..., C k be the connected components of G where V (C 1 ) V (C 2 ) V (C k ). By Lemma??, there is an edge assignment f : E(G) { 1, +1} such that for every C i, ω(c i ) 1, and for each v V (C i ), S Ci (v) 1 and ω(c i ) has minimum possible value. Now, we extend f to E(G) by assigning +1 to every edge of C. Assume that r is the number of connected components of G which have at least 3 vertices. Now, two cases can be considered: Case 1. r = 1. Thus ω(g) = ω(c) + ω(c 1 ) n + 1. Case 2. r = 2. If ω(c 1 ) 0 or ω(c 2 ) 0, then clearly we have ω(g) n + 1. Now, let ω(c 1 ) = ω(c 2 ) = 1. By Lemma 1, every vertex of C 1 and C 2 has even degree and also C 1 and C 2 have odd size. We claim that there exists an edge e = uv, u V (C 1 ) and v V (C 2 ). Assume that there is no such edge. Since G is connected we note that there exists x V (G)\(V (C 1 ) V (C 2 )). Since α(g) 2, there is no independent set of size 3. But since V (C 1 ) 3, V (C 2 ) 3 and the degree of x in C is 2, we conclude that 9

10 there are x 1 V (C 1 ) and x 2 V (C 2 ) such that xx 1, xx 2 / E(G). Hence {x, x 1, x 2 } is an independent set, a contradiction and the claim is proved. Now, let e = uv, u V (C 1 ) and v V (C 2 ). One can change f(e) from +1 to 1. Now, consider two Eulerian circuits for C 1 and C 2 and reassign the values of the edges of these two Eulerian circuits by +1 and 1 consecutively, starting from u and v with value +1. Hence, S G (z) 1, for every z V (G). Moreover, ω(g) n = n. Case 3. r 3. Suppose that U = {u 1, u 2, u 3 } V (C 1 ), V = {v 1, v 2, v 3 } V (C 2 ) and W = {w 1, w 2, w 3 } V (C 3 ). Since α(g) 2, the subgraph u i, v j, w t contains at least one edge in C, for every 1 i, j, t 3. So the induced subgraph on U V W has at least 9 edges in C. Thus V (G) = 9. Now, we claim that the induced subgraph on U is a triangle. To see this, let u i u j / E(G ), for 1 i < j 3. Every vertex in V (G)\U is adjacent to at least one of the vertices u i and u j. Hence, the degree of u i or u j in C is at least 3, a contradiction. Similarly, the induced subgraphs on V and W are triangle. Now, consider an arbitrary edge u i v j C. There is an edge assignment for U V such that S U (u i ) = S V (v j ) = 2, and ω( U ) = ω( V ) = 1. Now, change the value u i v j from +1 to 1. Obviously, ω(g) = 10. So γ ss (G) = V (G) + 1. (ii) Now, assume that G has at least one cut vertex. Clearly, there are two positive integers r and s such that G is the union of K r and K s and there exists a unique vertex v V (K r ) adjacent to v 1,..., v p V (K s ). Consider two following cases: Case 1. s is odd. By Theorem 1, there exists an SSDF for K s such that for every v V (K s ), S Ks (v) 2 and ω(k s ) s + 1. If r is odd, then by Theorem 1, there exists an SSDF such that ω(k r ) r + 1 and since the degree of v is even, S Kr (v) 2, for every v V (K s ). Let ω(k r ) = r. Now, for i = 1,..., p, define { +1 if i is even f(vv i ) = 1 otherwise. 10

11 Obviously, ω(g) s r a, where { 0 if p is even a = 1 otherwise. Now, let ω(k r ) = r + 1. Then one can find an SSDF for K r such that S Kr (v) 4. Now, let f(vv 1 ) = 1, and for every 2 i p, define { 1 if i is even f(vv i ) = +1 otherwise, ω(g) r + s + 2 a, where a = { 2 if p is even 1 otherwise. Otherwise, if r is even, then by Theorem 1, there exists an SSDF such that ω(k r ) = r 2. Now, for i = 1,..., p define, ω(g) r 2 + s a, where f(vv i ) = a = { 1 if i is even +1 otherwise, { 0 if p is even 1 otherwise. Case 2. s is even. Consider an edge assignment for K r such that ω(k r ) = γ ss (K r ). If r 1 (mod 4), then by Theorem 1, γ ss (K r ) = r + 1. In this case, clearly, there exists x V (K r ) such that S Kr (x) = 4. With no loss of generality one may assume that S Kr (v) = 4. Now, we assign +1, 1 to the edges T = {vv 1,..., vv p } according to Table??. For each cell of the table with value l, we assign 1 to l edges of T and +1 to the other edges. For instance, for p = 4t + 1, we assign 1 to exactly 2t, 2t and 2t + 2 edges of T, if γ ss (K r ) = r 2, r and r + 1, respectively. Now, we would like to divide the vertices of the set {w w {v 1, v 2,..., v p } and f(vw) = 1 } 11

12 γ ss (K r ) r 2 r r + 1 p 4t 2t 2t 2t 4t + 1 2t 2t 2t + 2 4t + 2 2t 2t 2t + 2 4t + 3 2t 2t + 2 2t + 2 Table 1: The number of edges with value 1 in terms of p and γ ss into 2-subsets. Consider a perfect matching M of K s containing the corresponding edges of these 2- subsets. We claim that there exists an SSDF for K s such that the values of all edges in M is 1 and ω(k s ) = s 2. It is well-known that the edges of K s can be decomposed into s 1 perfect matchings [?, p ]. If we assign 1 to all edges of s 2 1 arbitrary perfect matchings including M and +1 to all other edges of all other matchings, a required SSDF is obtained. Hence, the claim is proved. Consider this SSDF for K s and change the values of all edges corresponding to 2-subsets from 1 to +1. Now, we have ω(g) = γ ss (K r ) + (p 2q) + γ ss (K s ) + 2( q 2 ), where q is the number of edges between v and V (K s ) with value 1. By applying this formula to the all cases of Table??, we obtain the following table. γ ss (K r ) p 4t 4t + 1 4t + 2 4t + 3 r r 2 r r s 2 + 2t r s 2 + 2t (r + 1) s 2 + (2t) r s 2 + 2t r s 2 + 2t (r + 1) + ( 3) + s 2 + (2t + 2) r s 2 + 2t r s 2 + 2t (r + 1) + ( 2) + s 2 + (2t + 2) r s 2 + 2t r + ( 1) + s 2 + (2t + 2) (r + 1) + ( 1) + s 2 + (2t + 2) Table 2: ω(g) in terms of γ ss and p For instance, suppose that p = 4t+2 and γ ss (K r ) = r+1. We have (4t+2) 2(2t+2) = 2 and 2( q 2 ) = 2t + 2. Thus γ ss(g) = (r + 1) + ( 2) + s 2 + (2t + 2) r + s + 1. Clearly, 12

13 the value of each cell in this table is less than or equal r + s + 1. Hence γ ss (G) r + s + 1, and the proof is complete. References [1] R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer-Verlag, [2] C. Wang, The signed star domination numbers of the cartesian product graphs, Discrete Appl. Math. 155 (2007) [3] D.B. West, Introduction to Graph Theory, Prentice Hall Upper Saddle River, NJ, Second Edition, [4] G. Chartrand and L.Lesniak, Graphs and Digraphs, Chapman and Hall/CRC, Third Edition, [5] B. Xu, On edge domination numbers of graphs, Discrete Math. 294, (2005) Saieed Akbari s akbari@sharif.edu Department of Mathematical Sciences P.O. Box , Tehran, Iran. Ashkan Norouzi ashkan.afn@gmail.com Alireza Rezaei rezaei70@gmail.com Rahmtin Rotabi rahmtin.rotabi@gmail.com Sara Sabour sara.sabour@gmail.com Department of Computer Engineering Sharif University of Technology Tehran, Iran. 13

Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.

Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge. 1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one

More information

Rainbow game domination subdivision number of a graph

Rainbow game domination subdivision number of a graph Rainbow game domination subdivision number of a graph J. Amjadi Department of Mathematics Azarbaijan Shahid Madani University Tabriz, I.R. Iran j-amjadi@azaruniv.edu Abstract The rainbow game domination

More information

Complete Cototal Domination

Complete Cototal Domination Chapter 5 Complete Cototal Domination Number of a Graph Published in Journal of Scientific Research Vol. () (2011), 547-555 (Bangladesh). 64 ABSTRACT Let G = (V,E) be a graph. A dominating set D V is said

More information

Assignment 4 Solutions of graph problems

Assignment 4 Solutions of graph problems Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of

More information

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE

More information

GEODETIC DOMINATION IN GRAPHS

GEODETIC DOMINATION IN GRAPHS GEODETIC DOMINATION IN GRAPHS H. Escuadro 1, R. Gera 2, A. Hansberg, N. Jafari Rad 4, and L. Volkmann 1 Department of Mathematics, Juniata College Huntingdon, PA 16652; escuadro@juniata.edu 2 Department

More information

Fundamental Properties of Graphs

Fundamental Properties of Graphs Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,

More information

PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS

PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed

More information

Exercise set 2 Solutions

Exercise set 2 Solutions Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T

More information

CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN

CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P 11 is hamiltonian.

More information

THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS. N. Dehgardi, S. M. Sheikholeslami and L. Volkmann. 1. Introduction

THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS. N. Dehgardi, S. M. Sheikholeslami and L. Volkmann. 1. Introduction MATEMATIQKI VESNIK 67, 2 (2015), 102 114 June 2015 originalni nauqni rad research paper THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS N. Dehgardi, S. M. Sheikholeslami and L. Volkmann Abstract.

More information

Part II. Graph Theory. Year

Part II. Graph Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,

More information

Let G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.

Let G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v. Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,

More information

On Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract

On Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge

More information

Matching and Factor-Critical Property in 3-Dominating-Critical Graphs

Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics

More information

On total domination and support vertices of a tree

On total domination and support vertices of a tree On total domination and support vertices of a tree Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper and Bill Waller University of Houston-Downtown, Houston, Texas 7700 delavinae@uhd.edu, pepperr@uhd.edu,

More information

Collapsible biclaw-free graphs

Collapsible biclaw-free graphs Collapsible biclaw-free graphs Hong-Jian Lai, Xiangjuan Yao February 24, 2006 Abstract A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected

More information

HW Graph Theory SOLUTIONS (hbovik)

HW Graph Theory SOLUTIONS (hbovik) Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length

More information

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE Professor Kindred Math 104, Graph Theory Homework 3 Solutions February 14, 2013 Introduction to Graph Theory, West Section 2.1: 37, 62 Section 2.2: 6, 7, 15 Section 2.3: 7, 10, 14 DO NOT RE-DISTRIBUTE

More information

Characterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)

Characterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4) S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G

More information

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1 Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,

More information

Chapter 3: Paths and Cycles

Chapter 3: Paths and Cycles Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk

More information

Math 776 Graph Theory Lecture Note 1 Basic concepts

Math 776 Graph Theory Lecture Note 1 Basic concepts Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved

More information

Chapter 2 Graphs. 2.1 Definition of Graphs

Chapter 2 Graphs. 2.1 Definition of Graphs Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,

More information

Math 443/543 Graph Theory Notes 2: Transportation problems

Math 443/543 Graph Theory Notes 2: Transportation problems Math 443/543 Graph Theory Notes 2: Transportation problems David Glickenstein September 15, 2014 1 Readings This is based on Chartrand Chapter 3 and Bondy-Murty 18.1, 18.3 (part on Closure of a Graph).

More information

Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected

Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2

More information

Theorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.

Theorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path. 3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching

More information

4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.

4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar. UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.

More information

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc

More information

Network flows and Menger s theorem

Network flows and Menger s theorem Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality

More information

On vertex-coloring edge-weighting of graphs

On vertex-coloring edge-weighting of graphs Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and

More information

Chapter 6 GRAPH COLORING

Chapter 6 GRAPH COLORING Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1, 2,..., k} such that c (u) 6= c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called

More information

A Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1

A Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1 International Mathematical Forum, Vol. 11, 016, no. 14, 679-686 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/imf.016.667 A Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1 Haihui

More information

Problem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009

Problem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009 Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.

More information

Chapter 4. square sum graphs. 4.1 Introduction

Chapter 4. square sum graphs. 4.1 Introduction Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations

More information

v V Question: How many edges are there in a graph with 10 vertices each of degree 6?

v V Question: How many edges are there in a graph with 10 vertices each of degree 6? ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.

More information

Some relations among term rank, clique number and list chromatic number of a graph

Some relations among term rank, clique number and list chromatic number of a graph Discrete Mathematics 306 (2006) 3078 3082 www.elsevier.com/locate/disc Some relations among term rank, clique number and list chromatic number of a graph Saieed Akbari a,b, Hamid-Reza Fanaï a,b a Department

More information

K 4 C 5. Figure 4.5: Some well known family of graphs

K 4 C 5. Figure 4.5: Some well known family of graphs 08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph

More information

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,

More information

Triple Connected Domination Number of a Graph

Triple Connected Domination Number of a Graph International J.Math. Combin. Vol.3(2012), 93-104 Triple Connected Domination Number of a Graph G.Mahadevan, Selvam Avadayappan, J.Paulraj Joseph and T.Subramanian Department of Mathematics Anna University:

More information

1 Digraphs. Definition 1

1 Digraphs. Definition 1 1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together

More information

Lecture 4: Walks, Trails, Paths and Connectivity

Lecture 4: Walks, Trails, Paths and Connectivity Lecture 4: Walks, Trails, Paths and Connectivity Rosa Orellana Math 38 April 6, 2015 Graph Decompositions Def: A decomposition of a graph is a list of subgraphs such that each edge appears in exactly one

More information

Module 7. Independent sets, coverings. and matchings. Contents

Module 7. Independent sets, coverings. and matchings. Contents Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................

More information

Ma/CS 6b Class 5: Graph Connectivity

Ma/CS 6b Class 5: Graph Connectivity Ma/CS 6b Class 5: Graph Connectivity By Adam Sheffer Communications Network We are given a set of routers and wish to connect pairs of them to obtain a connected communications network. The network should

More information

Restricted edge connectivity and restricted connectivity of graphs

Restricted edge connectivity and restricted connectivity of graphs Restricted edge connectivity and restricted connectivity of graphs Litao Guo School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Xiaofeng Guo

More information

Chromatic Transversal Domatic Number of Graphs

Chromatic Transversal Domatic Number of Graphs International Mathematical Forum, 5, 010, no. 13, 639-648 Chromatic Transversal Domatic Number of Graphs L. Benedict Michael Raj 1, S. K. Ayyaswamy and I. Sahul Hamid 3 1 Department of Mathematics, St.

More information

Number Theory and Graph Theory

Number Theory and Graph Theory 1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com

More information

DOMINATION PARAMETERS OF A GRAPH AND ITS COMPLEMENT

DOMINATION PARAMETERS OF A GRAPH AND ITS COMPLEMENT Discussiones Mathematicae Graph Theory 38 (2018) 203 215 doi:10.7151/dmgt.2002 DOMINATION PARAMETERS OF A GRAPH AND ITS COMPLEMENT Wyatt J. Desormeaux 1, Teresa W. Haynes 1,2 and Michael A. Henning 1 1

More information

Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes

Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph

More information

HW Graph Theory SOLUTIONS (hbovik) - Q

HW Graph Theory SOLUTIONS (hbovik) - Q 1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into

More information

Domination in Jahangir Graph J 2,m

Domination in Jahangir Graph J 2,m Int. J. Contemp. Math. Sciences, Vol., 007, no. 4, 119-1199 Domination in Jahangir Graph J,m D. A. Mojdeh and A. N. Ghameshlou Department of Mathematics University of Mazandaran P.O. Box 47416-1467, Babolsar,

More information

Hamiltonian cycles in bipartite quadrangulations on the torus

Hamiltonian cycles in bipartite quadrangulations on the torus Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple

More information

A note on isolate domination

A note on isolate domination Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura

More information

Small Survey on Perfect Graphs

Small Survey on Perfect Graphs Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families

More information

Forced orientation of graphs

Forced orientation of graphs Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberi Bardia Sadri Abstract The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994.

More information

The strong chromatic number of a graph

The strong chromatic number of a graph The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same

More information

Subdivisions of Graphs: A Generalization of Paths and Cycles

Subdivisions of Graphs: A Generalization of Paths and Cycles Subdivisions of Graphs: A Generalization of Paths and Cycles Ch. Sobhan Babu and Ajit A. Diwan Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076,

More information

Vertex, Edge and Total Coloring. in Spider Graphs

Vertex, Edge and Total Coloring. in Spider Graphs Applied Mathematical Sciences, Vol. 3, 2009, no. 18, 877-881 Vertex, Edge and Total Coloring in Spider Graphs Sadegh Rahimi Sharebaf Department of Mathematics Shahrood University of Technology, Shahrood,

More information

On vertex types of graphs

On vertex types of graphs On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph

More information

Vertex 3-colorability of claw-free graphs

Vertex 3-colorability of claw-free graphs Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,

More information

Matching Theory. Figure 1: Is this graph bipartite?

Matching Theory. Figure 1: Is this graph bipartite? Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to

More information

Discharging and reducible configurations

Discharging and reducible configurations Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs

More information

Ma/CS 6b Class 4: Matchings in General Graphs

Ma/CS 6b Class 4: Matchings in General Graphs Ma/CS 6b Class 4: Matchings in General Graphs By Adam Sheffer Reminder: Hall's Marriage Theorem Theorem. Let G = V 1 V 2, E be a bipartite graph. There exists a matching of size V 1 in G if and only if

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite

More information

Varying Applications (examples)

Varying Applications (examples) Graph Theory Varying Applications (examples) Computer networks Distinguish between two chemical compounds with the same molecular formula but different structures Solve shortest path problems between cities

More information

Math 170- Graph Theory Notes

Math 170- Graph Theory Notes 1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory

More information

Math 778S Spectral Graph Theory Handout #2: Basic graph theory

Math 778S Spectral Graph Theory Handout #2: Basic graph theory Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible

More information

Graph Theory S 1 I 2 I 1 S 2 I 1 I 2

Graph Theory S 1 I 2 I 1 S 2 I 1 I 2 Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent

More information

DOUBLE DOMINATION CRITICAL AND STABLE GRAPHS UPON VERTEX REMOVAL 1

DOUBLE DOMINATION CRITICAL AND STABLE GRAPHS UPON VERTEX REMOVAL 1 Discussiones Mathematicae Graph Theory 32 (2012) 643 657 doi:10.7151/dmgt.1633 DOUBLE DOMINATION CRITICAL AND STABLE GRAPHS UPON VERTEX REMOVAL 1 Soufiane Khelifi Laboratory LMP2M, Bloc of laboratories

More information

Decreasing the Diameter of Bounded Degree Graphs

Decreasing the Diameter of Bounded Degree Graphs Decreasing the Diameter of Bounded Degree Graphs Noga Alon András Gyárfás Miklós Ruszinkó February, 00 To the memory of Paul Erdős Abstract Let f d (G) denote the minimum number of edges that have to be

More information

Module 11. Directed Graphs. Contents

Module 11. Directed Graphs. Contents Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................

More information

Double Vertex Graphs and Complete Double Vertex Graphs. Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007

Double Vertex Graphs and Complete Double Vertex Graphs. Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007 Double Vertex Graphs and Complete Double Vertex Graphs Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007 Abstract Let G = (V, E) be a graph of order n 2. The double vertex graph,

More information

WORM COLORINGS. Wayne Goddard. Dept of Mathematical Sciences, Clemson University Kirsti Wash

WORM COLORINGS. Wayne Goddard. Dept of Mathematical Sciences, Clemson University   Kirsti Wash 1 2 Discussiones Mathematicae Graph Theory xx (xxxx) 1 14 3 4 5 6 7 8 9 10 11 12 13 WORM COLORINGS Wayne Goddard Dept of Mathematical Sciences, Clemson University e-mail: goddard@clemson.edu Kirsti Wash

More information

Theorem 2.9: nearest addition algorithm

Theorem 2.9: nearest addition algorithm There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used

More information

Two Characterizations of Hypercubes

Two Characterizations of Hypercubes Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.

More information

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you

More information

Vertex-Colouring Edge-Weightings

Vertex-Colouring Edge-Weightings Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada

More information

Dynamically Random Graphs

Dynamically Random Graphs Dynamically Random Graphs Alexis Byers, Wittenberg University Mallory Reed, Earlham College Laura Rucci, Cabrini College Elle VanTilburg, University of Texas-Austin SUMSRI 203 Miami University July 8,

More information

Graph Theory Questions from Past Papers

Graph Theory Questions from Past Papers Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory

More information

Discrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs

Discrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results

More information

On the number of quasi-kernels in digraphs

On the number of quasi-kernels in digraphs On the number of quasi-kernels in digraphs Gregory Gutin Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK gutin@dcs.rhbnc.ac.uk Khee Meng Koh Department of

More information

Bipartite Roots of Graphs

Bipartite Roots of Graphs Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only

More information

How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?

How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities? 1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this

More information

Graph Theory Day Four

Graph Theory Day Four Graph Theory Day Four February 8, 018 1 Connected Recall from last class, we discussed methods for proving a graph was connected. Our two methods were 1) Based on the definition, given any u, v V(G), there

More information

IMO Training 2008: Graph Theory

IMO Training 2008: Graph Theory IMO Training 2008: Graph Theory by: Adrian Tang Email: tang @ math.ucalgary.ca This is a compilation of math problems (with motivation towards the training for the International Mathematical Olympiad)

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a

More information

Double Domination Edge Critical Graphs.

Double Domination Edge Critical Graphs. East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2006 Double Domination Edge Critical Graphs. Derrick Wayne Thacker East Tennessee

More information

Algorithm and Complexity of Disjointed Connected Dominating Set Problem on Trees

Algorithm and Complexity of Disjointed Connected Dominating Set Problem on Trees Algorithm and Complexity of Disjointed Connected Dominating Set Problem on Trees Wei Wang joint with Zishen Yang, Xianliang Liu School of Mathematics and Statistics, Xi an Jiaotong University Dec 20, 2016

More information

Extremal results for Berge-hypergraphs

Extremal results for Berge-hypergraphs Extremal results for Berge-hypergraphs Dániel Gerbner Cory Palmer Abstract Let G be a graph and H be a hypergraph both on the same vertex set. We say that a hypergraph H is a Berge-G if there is a bijection

More information

Graph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques.

Graph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques. Graph theory Po-Shen Loh June 013 1 Basic results We begin by collecting some basic facts which can be proved via bare-hands techniques. 1. The sum of all of the degrees is equal to twice the number of

More information

On the Rainbow Neighbourhood Number of Set-Graphs

On the Rainbow Neighbourhood Number of Set-Graphs On the Rainbow Neighbourhood Number of Set-Graphs Johan Kok, Sudev Naduvath arxiv:1712.02324v1 [math.gm] 6 Dec 2017 Centre for Studies in Discrete Mathematics Vidya Academy of Science & Technology Thalakkottukara,

More information

arxiv: v2 [math.co] 13 Aug 2013

arxiv: v2 [math.co] 13 Aug 2013 Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed

More information

On the packing numbers in graphs arxiv: v1 [math.co] 26 Jul 2017

On the packing numbers in graphs arxiv: v1 [math.co] 26 Jul 2017 On the packing numbers in graphs arxiv:1707.08656v1 [math.co] 26 Jul 2017 Doost Ali Mojdeh and Babak Samadi Department of Mathematics University of Mazandaran, Babolsar, Iran damojdeh@umz.ac.ir samadibabak62@gmail.com

More information

Some properties of the line graphs associated to the total graph of a commutative ring

Some properties of the line graphs associated to the total graph of a commutative ring Pure and Applied Mathematics Journal 013; () : 51-55 Published online April, 013 (http://wwwsciencepublishinggroupcom/j/pamj) doi: 1011648/jpamj0130011 Some properties of the line graphs associated to

More information

The Restrained Edge Geodetic Number of a Graph

The Restrained Edge Geodetic Number of a Graph International Journal of Computational and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 1 (2016), pp. 9 19 Research India Publications http://www.ripublication.com/ijcam.htm The Restrained Edge

More information

Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs

Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs Ermelinda DeLaViña and Iride Gramajo Department of Computer and Mathematical Sciences University of Houston-Downtown Houston, Texas

More information

Applied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap

Applied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap Applied Mathematical Sciences, Vol. 5, 011, no. 49, 437-44 M i -Edge Colorings of Graphs Július Czap Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University

More information

Eternal Domination: Criticality and Reachability

Eternal Domination: Criticality and Reachability Eternal Domination: Criticality and Reachability William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224-2669 wkloster@unf.edu Gary MacGillivray Department of Mathematics

More information

Parameterized graph separation problems

Parameterized graph separation problems Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.

More information

Graph Connectivity G G G

Graph Connectivity G G G Graph Connectivity 1 Introduction We have seen that trees are minimally connected graphs, i.e., deleting any edge of the tree gives us a disconnected graph. What makes trees so susceptible to edge deletions?

More information