Some results related to the toughness of3-domination critical graphs
|
|
- Maud Elliott
- 6 years ago
- Views:
Transcription
1 Discrete Mathematics 272 (2003) ome results related to the toughness of3-domination critical graphs Nawarat Ananchuen a;1, Michael D. Plummer b;2 a Department of Mathematics, ilpakorn University, Nakorn Pathom, Thailand b Department of Mathematics, Vanderbilt University, Nashville, TN 37240, UA Received 31 May 2001; received in revised form 3 October 2001; accepted 30 November 2001 Dedicated to Frank Harary on the occasion ofhis 80th birthday Abstract A graph G is said to be k -critical ifthe size ofany minimum dominating set ofvertices is k, but ifany edge is added to G the resulting graph can be dominated with k 1 vertices. The structure of k -critical graphs remains far from completely understood, even in the special case when the domination number = 3. In a 1983 paper, umner and Blitch proved a theorem which may regarded as a result related to the toughness of3--critical graphs which says that if is any vertex cutset ofsuch a graph, then G has at most + 1 components. In the present paper, we improve and extend this result considerably. c 2003 Elsevier B.V. All rights reserved. Keywords: Domination; Critical edge; Toughness 1. Introduction Let G denote a nite undirected graph with vertex set V (G) and edge set E(G). A set V (G) isa(vertex) dominating set for G ifevery vertex ofg either belongs to or is adjacent to a vertex of. The minimum cardinality ofa vertex dominating set in G is called the vertex domination number (or simply the domination number) of G and is denoted by (G). Graph G is said to be k-domination critical (or simply k -critical) if(g)=k, but (G + e)=k 1 for each edge e E(G). In this paper, 1 upported by The Thailand Research Fund Grant #BRG upported by NF Grant # INT addresses: nawarat@kanate.su.ac.th (N. Ananchuen), michael.d.plummer@vanderbilt.edu (M.D. Plummer) X/03/$ - see front matter c 2003 Elsevier B.V. All rights reserved. doi: / x(03)
2 6 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) 5 15 we will be concerned only with the case k = 3. Although a number ofresults exist concerning 3--critical graphs, their structure is far from completely understood. (For summaries ofmost known results, see [5, Chapter 16] as well as [4].) If G is 3--critical and disconnected, then G is the disjoint union ofa 2--critical graph and a complete graph. (ee [6].) Hence we will consider only connected 3-critical graphs. umner and Blitch [6] were the rst to study 3--critical graphs. Our main purpose in this paper is to extend their result which follows. It can be viewed as a toughness result for 3--critical graphs. Theorem 1.1. Let G be a connected 3--critical graph. Then if is a vertex cutset in G; G has at most +1 components. This result was recently extended by Flandrin et al. [4] as follows. We denote the number ofcomponents ofg by!(g ). Theorem 1.2. Let G be a connected 3--critical graph. If is a vertex cutset in G such that!(g )= +1, then each vertex v is a cutvertex of G. If u; v and w are vertices of G and u and v dominate G w, we will follow the previously accepted notation and write [u; v] w. uppose G is 3--critical. If u and v are non-adjacent vertices of G, then (G + uv) = 2 and so there is a vertex x V (G) such that either [u; x] v or [v; x] u. In addition to Theorem 1.1, umner and Blitch [6] also proved the following lemma for the case n 4. The cases n = 2 and 3 were proved in [4, Lemma 1]. This lemma will be used repeatedly throughout our paper. Lemma 1.3. Let G be a connected 3--critical graph and let be an independent set of n 2 vertices in V (G). (i) Then the vertices of can be ordered a 1 ;a 2 ;:::;a n in such a way that there exists a sequence of distinct vertices x 1 ;x 2 ;:::;x n 1 so that [a i ;x i ] a i+1 for i = 1; 2;:::;n 1. (ii) If, in addition, n 4, then the x i s can be chosen so that x 1 x 2 x n 1 is a path and {x 1 ;:::;x n 1 } =. Two additional results from [6] which will be ofhelp to us are the next two lemmas. Lemma 1.4. If G is a connected 3--critical graph, then no two endvertices of G have a common neighbor. Lemma 1.5. The diameter of any connected 3--critical graph is at most three. Blitch [2] proved the next result.
3 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) Lemma 1.6. If G is a connected 3--critical graph and v is a cutvertex of G, then v is adjacent to an endvertex of G. The following two results of Wojcicka [7] will also prove useful to us. Theorem 1.7. If G is a connected 3--critical graph with more than six vertices, then G has a Hamiltonian path. To state the next theorem, we make use ofthe concept ofa full 3--critical graph. For any p 6, let a + b + c = p 3 be any partition of p 3. Let H be a complete graph on p 3 vertices and let A B C = V (H) be a partition ofthe vertices ofh with A = a; B = b and C = c. Form a new graph G by adding to H three new vertices u; v and w with N (u) =A; N (v) =B and N(w) =C. (Here as usual, N(v) denotes the neighborhood ofvertex v.) Then G is clearly 3--critical and is said to be full. Theorem 1.8. Let G be a connected 3--critical graph having two endvertices. Then G is full. Finally, in what is to follow, we shall also make frequent use of the following easy result. Lemma 1.9. Let G be a 3--critical graph and let u and v be non-adjacent vertices of G. If x is a vertex of G such that [u; x] v, then xv E(G) and if x is a vertex of G with [v; x] u then xu E(G). Proof. uppose [u; x] v. Ifxv E(G), then u and x dominate G, contradicting the assumption that (G) = 3. imilarly, if[v; x] u, then xu E(G). 2. The main theorem Theorem 2.1. Let G be a connected 3--critical graph and let be a vertex cutset in G. Then (a) if 4; G has at most 1 components, (b) if =3, then G contains at most components, and if G has exactly three components, then each component is complete and at least one is a singleton, (c) if =2, then G has at most three components and if G has exactly three components, then G must have the structure shown below in Fig. 1, (d) if =1, then G has two components, exactly one of which is a singleton. Furthermore, G has exactly one or two cutvertices and if it has two, G is isomorphic to a graph of the type shown in Fig. 1. Proof. Part (a) follows immediately from Lemma 6 of [6] and Lemma 3 of[3].
4 8 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) K 1 K 2 + K n-1 n 2 + K 1 Fig. 1. We turn now to part (b). uppose is a vertex cutset in G and = 3. We want to show that G contains at most components. uppose, to the contrary, that G contains at least +1=4 components. Then by Theorem 1.1, G contains exactly four components. Let H i denote these four components, i =1;:::;4. Choose a vertex w i V (H i ); 1 6 i 6 4. Clearly W = {w 1 ;w 2 ;w 3 ;w 4 } is an independent set. By Lemma 1.3, the vertices in W may be ordered as a 1 ;a 2 ;a 3 ;a 4 in such a way that there exists a path x 1 x 2 x 3 in G W such that [a i ;x i ] a i+1,fori =1; 2; 3. By Lemma 1.9, x i a i+1 E(G), for each i =1; 2; 3. Clearly x i for i =1; 2; 3. ince [a i ;x i ] a i+1 and x i a i+1 E(G); x i is adjacent to every vertex of 4 j=1 V (H j) (V (H i ) {a i+1 }), for i =1; 2; 3. o x i x j for all 1 6 i j 6 3. Thus {x 1 ;x 2 ;x 3 } =. Consider now G + a 1 a 3. There must exist a vertex y G {a 1 ;a 3 } such that either [a 3 ;y] a 1 or [a 1 ;y] a 3. Clearly in either case y. By Lemma 1.9 and the fact that x i a i+1 E(G), for i =1; 2; 3, the case [a 3 ;y] a 1 is impossible. Hence [a 1 ;y] a 3. But then y = x 2. Now x 2 is adjacent to every vertex of 4 i=1 V (H i) {a 3 }.By
5 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) this fact and the fact that x 1 x 2 x 3 is a path, vertices x 2 and a 3 together dominate G, a contradiction. o G contains at most three components as claimed. Now suppose G contains exactly three components. We now show that in this instance, each ofthe three components must be complete. uppose to the contrary that there exists a component C of G such that V (C) 2 and C is not complete. Then there exist two non-adjacent vertices w 1 and w 2 in C. Let C 1 and C 2 be the other two components of G. Choose w 3 V (C 1 ) and w 4 V (C 2 ). Then W = {w 1 ;w 2 ;w 3 ;w 4 } is an independent set. o by Lemma 1.3 the vertices of W may be ordered a 1 ;a 2 ;a 3 ;a 4 in such a way that there exists a path x 1 x 2 x 3 in G W such that [a i ;x i ] a i+1 for i =1; 2; 3. Clearly, x i x j for 1 6 i j 6 3 and by Lemma 1.9, x i a i+1 E(G). Claim 1. {x 1 ;x 2 ;x 3 }. uppose to the contrary that {x 1 ;x 2 ;x 3 } = and consider G + a 1 a 4. ince (G + a 1 a 4 ) = 2, there exists a vertex z V (G) {a 1 ;a 4 } such that [a 4 ;z] a 1 or [a 1 ;z] a 4. uppose [a 4 ;z] a 1.Ifz, then z = x 3 since x 1 a 2 E(G) and x 2 a 3 E(G). But this contradicts Lemma 1.9 since [a 3 ;x 3 ] a 4 and a 1 a 3 E(G). Thus z. But this implies that a 2 and a 3 are in the same component of G ; call it H. But then z V (H). Hence z is adjacent to every vertex of H {z}. ince [a 2 ;x 2 ] a 3, vertex x 2 is adjacent to every vertex of H 1 H 2 where H 1 and H 2 are the components of G containing vertices a 1 and a 4, respectively. ince x 1 x 2 x 3 is a path, vertex x 2 is adjacent to x 1 and x 3. Hence {x 2 ;z} dominates G, a contradiction. Hence [a 1 ;z] a 4. uppose z. ince x 1 a 2 E(G) and x 2 a 3 E(G); z= x 3.By using this fact and the fact that [a 3 ;x 3 ] a 4, vertex x 3 is adjacent to every vertex of G (N (a 1 ) N (a 3 )), except a 4. ince [a 2 ;x 2 ] a 3, edge x 2 a 4 E(G). Because x 1 x 2 x 3 is a path, edge x 1 x 2 E(G). Hence {x 2 ;x 3 } dominates G, a contradiction. Hence z. By applying the same argument as above, one can show that {x 2 ;z} dominates G, again a contradiction. This completes the proofofclaim 1. Claim 2. {x 1 ;x 2 ;x 3 } 2. uppose to the contrary that {x 1 ;x 2 ;x 3 } 2. Then by Claim 1, {x 1 ;x 2 ;x 3 } =2. Case 2.1: uppose x 1 and x 2. ince [a 3 ;x 3 ] a 4, and {a 1 ;a 2 ;a 3 ;a 4 } is independent, edge x 3 a 1 E(G) and edge x 3 a 2 E(G). Thus a 1 ;a 2 and x 3 belong to the same component of G, say H 1. Moreover, then, vertex x 3 dominates all of H 1. Let H 2 and H 3 be the components of G containing a 3 and a 4, respectively. Clearly H i H j, for 1 6 i j 6 3. Furthermore, V (H 3 )={a 4 }. Choose w {x 1 ;x 2 }.Ifx 1 w E(G), then {x 1 ;x 3 } dominates G since x 3 dominates H 1 and x 1 dominates H 2 H 3 {x 2 ;w}, a contradiction. Hence x 1 w E(G). imilarly, x 3 w E(G). ince [a 1 ;x 1 ] a 2 and [a 3 ;x 3 ] a 4, we have a 1 w E(G) and a 3 w E(G). Fig. 2 depicts this situation. Recall that x i a i+1 E(G), for i=1; 2; 3. Now consider G+a 1 a 4. ince (G+a 1 a 4 )=2, there exists a vertex z G {a 1 ;a 4 } such that [a 4 ;z] a 1 or [a 1 ;z] a 4. uppose
6 10 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) 5 15 x 1 x 2 w a 1 x 3 a3 a 4 a 2 H 3 H 1 H2 Fig. 2. rst that [a 4 ;z] a 1. ince a 2 and a 3 are in dierent components of G ; z. But z x 1 since x 1 a 2 E(G), and z x 2 since x 2 a 3 E(G). Thus z = w. But this is also impossible since wx 3 E(G). Hence [a 1 ;z] a 4. Because a 1 a 2 E(G) and a 2 and a 3 are in dierent components of G, it follows that z. By Lemma 1.9, z x 1 and z x 2 since x 1 a 4 E(G) and x 2 a 4 E(G). Thus z = w. But then wa 4 E(G) by Lemma 1.9. Now consider G+a 2 a 4. ince (G+a 2 a 4 )=2, there exists a vertex z V (G) {a 2 ;a 4 } such that [a 2 ;z] a 4 or [a 4 ;z] a 2. uppose [a 2 ;z] a 4. ince a 1 a 2 E(G) and a 1 and a 3 are in dierent components of G, it follows that z. ince x 1 a 4 and x 2 a 4 E(G), by Lemma 1.9 it follows that z {x 1 ;x 2 }. But then z = w. However, this is also impossible since wx 1 E(G) and a 2 x 1 E(G). Hence [a 4 ;z] a 2. Because a 1 and a 3 are in dierent components of G, it follows that z. Clearly, z x 2 and z w since x 2 a 3 E(G) and wx 3 E(G). Thus z = x 1. But this is also impossible since x 1 w E(G) and a 4 w E(G). This contradiction proves Case 2.1. Case 2.2: uppose x 1 and x 3. ince [a 2 ;x 2 ] a 3 and {a 1 ;a 2 ;a 3 ;a 4 } is independent, edge a 1 x 2 E(G) and edge a 4 x 2 E(G). Thus, a 1 ;a 4 and x 2 all belong to the same component of G, say H 1. Let H 2 and H 3 be the components of G containing a 2 and a 3, respectively.
7 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) x 1 x 3 w a 1 x 2 a 2 a 3 a 4 H 3 H 1 H 2 Fig. 3. Clearly H i H j for 1 6 i j 6 3. Furthermore, V (H 3 )={a 3 }. Choose w {x 1 ;x 3 }.Ifx 1 w E(G), then {x 1 ;x 3 } dominates G since x 3 dominates (H 1 {a 4 }) H 2 and x 1 dominates (H 2 {a 2 }) H 3 {a 4 ;w}, a contradiction. Hence x 1 w E(G). imilarly, x 3 w E(G). ince [a 1 ;x 1 ] a 2, edge a 1 w E(G) and since [a 3 ;x 3 ] a 4, edge a 3 w E(G). Fig. 3 illustrates this situation. Now consider G + a 1 a 3. since (G + a 1 a 3 ) = 2, there exists a vertex z G {a 1 ;a 3 } such that [a 1 ;z] a 3 or [a 3 ;z] a 1. uppose [a 1 ;z] a 3. ince a 1 a 4 E(G) and a 2 and a 4 are in dierent components of G, it follows that vertex z. Because x 1 a 3 and wa 3 E(G), vertex z {x 1 ;w} by Lemma 1.9. Thus z = x 3. But this is impossible since x 3 a 4 and a 1 a 4 E(G). Hence [a 3 ;z] a 1. Because a 2 and a 4 are in dierent components of G, it follows that vertex z. By Lemma 1.9, vertex z {x 3 ;w}, since x 3 a 1 and wa 1 E(G). Thus z = x 1. But this is also impossible since x 1 a 2 E(G). Thus Case 2.2 is settled. Case 2.3: uppose x 2 and x 3. ince [a 1 ;x 1 ] a 2 and {a 1 ;a 2 ;a 3 ;a 4 } is independent, edge a 3 x 1 E(G) and edge a 4 x 1 E(G). Thus, a 3 ;a 4 and x 1 belong to the same component of G, say H 3. Moreover, vertex x 1 dominates all of H 3. Let H 1 and H 2 be the components of G containing a 1 and a 2, respectively. Clearly H i H j, for 1 6 i j 6 3. Furthermore, V (H 2 )={a 2 }. Choose w {x 2 ;x 3 }.Ifx 3 w E(G), then {x 1 ;x 3 } dominates G since x 3 dominates H 1 H 2 {x 2 ;w} and x 1 dominates H 3, a contradiction.
8 12 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) 5 15 x 2 x 3 w a 3 a 4 a 1 a 2 x 1 H 1 H 2 H 3 Fig. 4. Thus x 3 w E(G). imilarly, x 1 w E(G). ince [a 1 ;x 1 ] a 2, edge a 1 w E(G) and since [a 3 ;x 3 ] a 4, edge a 3 w E(G). Fig. 4 shows this situation. Now consider G + a 1 a 3. ince (G + a 1 a 3 ) = 2, there exists a vertex z G {a 1 ;a 3 } such that [a 1 ;z] a 3 or [a 3 ;z] a 1. uppose rst that [a 3 ;z] a 1. ince a 2 and a 4 are in dierent components of G, vertex z. Because [a i ;x i ] a i+1 for i =1; 2; 3, edges a 1 x 2 and a 1 x 3 E(G). ince a 1 w E(G), by Lemma 1.9 vertex z {x 2 ;x 3 ;w} =, a contradiction. Hence [a 1 ;z] a 3. By the same argument as above, vertex z. By Lemma 1.9, z w since wa 3 E(G). Clearly z x 3, since x 3 a 4 E(G). Thus z = x 2. By this fact and the fact that [a 2 ;x 2 ] a 3, vertex x 2 dominates (H 1 H 2 H 3 {x 3 }) {a 3 }. But then, since a 3 w E(G); {w; x 2 } dominates G, a contradiction. This completes the proofin Case 2.3 and hence Claim 2 is proved. By Claims 1 and 2, {x 1 ;x 2 ;x 3 } 6 1. uppose x 1. Then x 2 and x 3 are in some component of G. Because {a 1 ;a 2 ;a 3 ;a 4 } is independent and [a 2 ;x 2 ] a 3, vertex x 2 is adjacent to both a 1 and a 4. imilarly, vertex x 3 is adjacent to both a 1 and a 2. Hence a 1 ;a 2 and a 4 are in the same component. But this contradicts our choice ofthe a i. Hence x 1. imilarly, x 3. By applying a similar argument, if x 2, then a 1 and a 2 are in the same component of G and a 3 and a 4 are in the same component of G which again contradicts the choice of a i. Hence {x 1 ;x 2 ;x 3 }=. This implies that each x i belongs to some component of G. ince [a i ;x i ] a i+1,fori =1; 2; 3, it follows that x 1 is adjacent to a 3 and a 4 ; x 2 is adjacent to a 1 and a 4 and x 3 is adjacent to a 1 and a 2. This implies that a 1 ;a 2 ;a 3 and a 4 are in the same component of G, again contradicting the choice ofthe a i. Hence each component of G is complete. Next, we show that at least one ofthe three complete components must be a singleton. uppose to the contrary that each component of G has at least two vertices. Let
9 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) H i be the components of G ; i=1; 2; 3. For each i=1; 2; 3, choose w i V (H i ). Clearly {w 1 ;w 2 ;w 3 } is an independent set. By Lemma 1.3 the vertices in W may be ordered as a 1 ;a 2 ;a 3 in such a way that there exist vertices x 1 and x 2 such that [a i ;x i ] a i+1 for i =1; 2. Without loss ofgenerality, we may renumber the components ofg in such a way that a i V (H i ). ince each component of G has at least two vertices, x 1 and x 2 must belong to. Clearly x 1 x 2. Let {x 1 ;x 2 }={w}. Choose a 1 V (H 1) {a 1 } and a 3 V (H 3) {a 3 }. Consider G + a 1 a 3. ince (G + a 1 a 3 ) = 2, there exists a vertex z V (G) {a 1 ;a 3 } such that [a 1 ;z] a 3 or [a 3 ;z] a 1. In either case, z. uppose rst that [a 1 ;z] a 3. ince x 1a 2 E(G) and x 2 a 3 E(G); z x 1 and z x 2. Thus z =w. This implies that w dominates (H 2 H 3 ) {a 3 }. ince x 1a 2 E(G) and [a 2 ;x 2 ] a 3, vertex x 2 dominates (H 1 H 3 {x 1 }) {a 3 }. Thus {w; x 2 } dominates G, a contradiction. Hence [a 3 ;z] a 1. Because x 1a 2 E(G), z x 1. ince x 2 a 1 E(G), by Lemma 1.9 z x 2. Thus z = w. This implies that w dominates (H 1 H 2 ) {a 1 }. Now consider G + a 1 a 3. ince (G + a 1a 3 ) = 2, there exists a vertex z 1 G {a 1 ;a 3 } such that [a 1 ;z 1 ] a 3 or [a 3 ;z 1] a 1. In either case z 1. uppose [a 1 ;z 1 ] a 3. ince x 1a 2 E(G) and x 2 a 3 E(G); z 1 x 1 and z 1 x 2. Thus z 1 =w. By using this fact and the fact that [a 3 ;w] a 1, we see that w dominates (H 1 H 2 H 3 ) {a 1 ;a 3 }. ince x 1a 2 E(G) and [a 2 ;x 2 ] a 3, vertex x 2 dominates (H 1 H 3 {x 1 }) {a 3 }. Thus {x 2 ;w} dominates G, a contradiction. Hence [a 3 ;z 1] a 1. ince x 1 a 2 E(G) and wa 1 E(G); z 1 x 1 and z 1 w. Thus z 1 = x 2. But this contradicts Lemma 1.9 since a 1 x 2 E(G). This completes the proof ofpart (b). Next we turn to part (c). uppose therefore that is a vertex cutset with =2. Then by the Theorem 1.1,!(G ) 6 3. uppose that G has precisely three components. Let s 1 and s 2 be the vertices of and let H i ; i =1; 2; 3, be the three components of G. By Theorem 1.2, both s 1 and s 2 are cutvertices. o each s i ; i=1; 2, is adjacent to an endvertex of G by Lemma 1.6. og has at least two endvertices, say a 1 and a 2. Furthermore, neither a 1 nor a 2 is in. ince no two endvertices of G have a common neighbor by Lemma 1.4, we may assume, without loss ofgenerality, that a i s i E(G) and a i V (H i )fori =1; 2. If V (G) 7, then G must have exactly two endvertices since G has a Hamiltonian path by Theorem 1.7. Hence by Theorem 1.8, graph G is ofthe type shown in Fig. 1, where n 3. o now let us assume that V (G) 6 6. ince a i is an endvertex of G and a i s i E(G), for i =1; 2;V(H i )={a i }. If V (H 3 ) = 1, then, since G is connected, (G) =2, a contradiction. Hence V (H 3 ) = 2. Let V (H 3 )={a 3 ;a 4 }. ince G is connected, we may assume that a 3 s 1 E(G). But then a 4 s i E(G) f or i = 1 and 2; otherwise {s 1 ;s 2 } dominates G. Thus a 4 is an endvertex of G. uppose a 3 s 2 E(G) and consider G + a 3 s 2. ince (G + a 3 s 2 ) = 2, there is a vertex z of G {a 3 ;s 2 } such that either [a 3 ;z] s 2 or [s 2 ;z] a 3. uppose [a 3 ;z] s 2. Then by Lemma 1.9, z a 2 since a 2 s 2 E(G). Thus [a 3 ;z] s 2 is impossible since N(a 2 )={s 2 }. imilarly, [s 2 ;z] a 3 is also impossible. This contradiction proves that s 2 a 3 E(G). By applying a similar argument, edge s 1 s 2 E(G). Hence G is a graph ofthe type shown in Fig. 1 where n =2.
10 14 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) 5 15 K n (a) (b) (c) n 2 Fig. 5. This completes the proofofpart (c). Finally, suppose = 1. Let c be a cutvertex of G. Then G c has exactly two components by the Theorem 1.1. Moreover, one ofthe two components is a singleton by Lemma 1.6. (Clearly it cannot happen that both components of G c are singletons, for then V (G) =3 and so (G) 3 since G is connected.) If V (G) 6 6, it is easy to see that G must be isomorphic to the six-vertex graph shown in Fig. 5(a). o suppose V (G) 7. Then G has a Hamiltonian path by Theorem 1.7. But then G has at most two endedges. Ifit has two endedges, then by [6, Remark, p. 70] it must be isomorphic to a graph ofthe type shown in Fig. 1. This completes the proofofpart (d) and hence the theorem is proved. Pertaining to part (b) ofthe preceding theorem, we point out that it is not possible to say more about the number ofsingleton components, for in Fig. 5 we present examples in which G has three, two and one singleton components. On the other hand, ifone assumes that is a cutset with =3;!(G ) = 3 and, in addition, (G) = 3, it is shown in [3] that one can say a bit more. Namely, in this case each ofthe three components ofg is complete and ifone orders the three components by size as V (C 1 ) 6 V (C 2 ) 6 V (C 3 ), then either (i) C 1 = C 2 = K 1 and G belongs to an innite family of graphs G 1 or (ii) C 1 = K 1 ; C 2 = K 3 and G belongs to a second innite family of graphs G 2. (The graph families G 1 and G 2 are described in [3].) However, if1 6 (G) 6 2, Lemmas 4 6 of[3] do not apply, whereas, on the other hand, parts (c) and (d) oftheorem 2.1 hold. The following result is an immediate corollary of Theorem 2.1. Corollary 2.2. Let G be a connected 3--critical graph and let be a cutset in G. If G has exactly +1 components, then 6 2. The results ofthe present paper, together with those in [3], can be applied to the study oftoughness in a 3--critical graph. Recall that the toughness ofa (connected)
11 N. Ananchuen, M.D. Plummer / Discrete Mathematics 272 (2003) graph G; (G), is dened as follows. (G) = min{ =!(G )} where the minimum is taken over all cutsets of G. It follows from Theorem 2.1(d) that every connected 3--critical graph has toughness at least 1 2 and it was shown in [4] that every 2-connected 3--critical graph has toughness at least 1. If G isa3--critical graph with (G) 3, then (G) 1 and (G) = 1 ifand only ifg belongs to a special innite family described in [3]. If G isa3--critical graph with (G) = 2, then by Theorem 3of[3], (G) = 1. Finally, if G isa3--critical graph with (G) = 1, then G has the structure described in part (d) oftheorem 2.1 and in particular, (G)= 1 2. Remarks. (1) We use the results ofthe present work in [1] in which we obtain new information on matchings in 3--critical graphs. (2) We are very grateful to one of the referees who, while refereeing our paper, pointed out the existence ofpaper [3]. Although we have an independent proofofpart (a) oftheorem 2.1, we have omitted it here in favor of [3] which has publication precedence. References [1] N. Ananchuen, M.D. Plummer, Matching properties in domination critical graphs, Discrete Math., to be published. [2] P. Blitch, Domination in Graphs, Ph.D. Dissertation, University ofouth Carolina, [3] Y. Chen, F. Tian, B. Wei, The 3-domination-critical graphs with toughness one, Utilitas Math. 61 (2002) [4] E. Flandrin, F. Tian, B. Wei, L. Zhang, ome properties of3-domination-critical graphs, Discrete Math. 205 (1999) [5] T.W. Haynes,.T. Hedetniemi, P.J. later, Domination in Graphs; Advanced Topics, Marcel Dekker, New York, [6] D.P. umner, P. Blitch, Domination critical graphs, J. Combin. Theory er. B 34 (1983) [7] E. Wojcicka, Hamiltonian properties ofdomination-critical graphs, J. Graph Theory 14 (1990)
Abstract. 1. Introduction
MATCHINGS IN 3-DOMINATION-CRITICAL GRAPHS: A SURVEY by Nawarat Ananchuen * Department of Mathematics Silpaorn University Naorn Pathom, Thailand email: nawarat@su.ac.th Abstract A subset of vertices D of
More informationMatching 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 informationDiscrete 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 informationDouble 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 informationK 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 informationDOUBLE 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 informationEdge coloring ofgraphs with small average degrees
Discrete Mathematics 275 (2004) 207 218 www.elsevier.com/locate/disc Edge coloring ofgraphs with small average degrees Rong Luo a, Cun-Quan Zhang b;1 a Department of Mathematical Sciences, Middle Tennessee
More informationFundamental 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 informationEulerian subgraphs containing given edges
Discrete Mathematics 230 (2001) 63 69 www.elsevier.com/locate/disc Eulerian subgraphs containing given edges Hong-Jian Lai Department of Mathematics, West Virginia University, P.O. Box. 6310, Morgantown,
More informationNote A further extension of Yap s construction for -critical graphs. Zi-Xia Song
Discrete Mathematics 243 (2002) 283 290 www.elsevier.com/locate/disc Note A further extension of Yap s construction for -critical graphs Zi-Xia Song Department of Mathematics, National University of Singapore,
More informationOn 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 informationA 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 informationCLAW-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 informationOn 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 informationSigned domination numbers of a graph and its complement
Discrete Mathematics 283 (2004) 87 92 www.elsevier.com/locate/disc Signed domination numbers of a graph and its complement Ruth Haas a, Thomas B. Wexler b a Department of Mathematics, Smith College, Northampton,
More informationGEODETIC 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 informationBounds on the signed domination number of a graph.
Bounds on the signed domination number of a graph. Ruth Haas and Thomas B. Wexler September 7, 00 Abstract Let G = (V, E) be a simple graph on vertex set V and define a function f : V {, }. The function
More informationThe Computational Complexity of Graph Contractions II: Two Tough Polynomially Solvable Cases
The Computational Complexity of Graph Contractions II: Two Tough Polynomially Solvable Cases Asaf Levin Department of Statistics, The Hebrew University, Jerusalem 91905, Israel Daniel Paulusma Department
More informationNumber 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 informationThe Dual Neighborhood Number of a Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 47, 2327-2334 The Dual Neighborhood Number of a Graph B. Chaluvaraju 1, V. Lokesha 2 and C. Nandeesh Kumar 1 1 Department of Mathematics Central College
More informationRestricted 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 informationCollapsible 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 informationA generalization of Dirac s theorem on cycles through k vertices in k-connected graphs
Discrete Mathematics 307 (2007) 878 884 www.elsevier.com/locate/disc A generalization of Dirac s theorem on cycles through k vertices in k-connected graphs Evelyne Flandrin a, Hao Li a, Antoni Marczyk
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
More informationChromatic 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 informationVertex 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 informationSOME RECENT RESULTS ON DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 26 (2006 ) 457 474 SOME RECENT RESULTS ON DOMINATION IN GRAPHS Michael D. Plummer Department of Mathematics Vanderbilt University Nashville, Tennessee 37240, USA
More informationTREES WITH UNIQUE MINIMUM DOMINATING SETS
TREES WITH UNIQUE MINIMUM DOMINATING SETS Sharada B Department of Studies in Computer Science, University of Mysore, Manasagangothri, Mysore ABSTRACT A set D of vertices of a graph G is a dominating set
More informationarxiv: v3 [cs.dm] 24 Jul 2018
Equimatchable Claw-Free Graphs aieed Akbari a,1, Hadi Alizadeh b, Tınaz Ekim c, Didem Gözüpek b, Mordechai halom c,d,2 a Department of Mathematical ciences, harif University of Technology, 11155-9415,
More informationRainbow 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 informationPAijpam.eu TOTAL CO-INDEPENDENT DOMINATION OF JUMP GRAPH
International Journal of Pure and Applied Mathematics Volume 110 No. 1 2016, 43-48 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v110i1.4
More informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationOn a conjecture of Keedwell and the cycle double cover conjecture
Discrete Mathematics 216 (2000) 287 292 www.elsevier.com/locate/disc Note On a conjecture of Keedwell and the cycle double cover conjecture M. Mahdian, E.S. Mahmoodian, A. Saberi, M.R. Salavatipour, R.
More informationOn 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 informationThe 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 informationEulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics 143 (2004) 336 341 Notes Eulerian disjoint paths problem in grid graphs is NP-complete Daniel Marx www.elsevier.com/locate/dam Department of Computer Science and Information
More informationSuper connectivity of line graphs
Information Processing Letters 94 (2005) 191 195 www.elsevier.com/locate/ipl Super connectivity of line graphs Jun-Ming Xu a,,minlü a, Meijie Ma a, Angelika Hellwig b a Department of Mathematics, University
More informationVertex Minimal and Common Minimal Equitable Dominating Graphs
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 10, 499-505 Vertex Minimal and Common Minimal Equitable Dominating Graphs G. Deepak a, N. D. Soner b and Anwar Alwardi b a Department of Mathematics The
More informationON VERTEX b-critical TREES. Mostafa Blidia, Noureddine Ikhlef Eschouf, and Frédéric Maffray
Opuscula Math. 33, no. 1 (2013), 19 28 http://dx.doi.org/10.7494/opmath.2013.33.1.19 Opuscula Mathematica ON VERTEX b-critical TREES Mostafa Blidia, Noureddine Ikhlef Eschouf, and Frédéric Maffray Communicated
More informationGraphs That Are Randomly Traceable from a Vertex
Graphs That Are Randomly Traceable from a Vertex Daniel C. Isaksen 27 July 1993 Abstract A graph G is randomly traceable from one of its vertices v if every path in G starting at v can be extended to a
More informationPentagons vs. triangles
Discrete Mathematics 308 (2008) 4332 4336 www.elsevier.com/locate/disc Pentagons vs. triangles Béla Bollobás a,b, Ervin Győri c,1 a Trinity College, Cambridge CB2 1TQ, UK b Department of Mathematical Sciences,
More informationSANDRA SPIROFF AND CAMERON WICKHAM
A ZERO DIVISOR GRAPH DETERMINED BY EQUIVALENCE CLASSES OF ZERO DIVISORS arxiv:0801.0086v2 [math.ac] 17 Aug 2009 SANDRA SPIROFF AND CAMERON WICKHAM Abstract. We study the zero divisor graph determined by
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationGraph 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 informationMath 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 informationChapter-0: Introduction. Chapter 0 INTRODUCTION
Chapter 0 INTRODUCTION 1 Graph Theory is a branch of Mathematics which has become quite rich and interesting for several reasons. In last three decades hundreds of research article have been published
More informationOn Independent Equitable Cototal Dominating set of graph
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X Volume 12, Issue 6 Ver V (Nov - Dec2016), PP 62-66 wwwiosrjournalsorg On Independent Equitable Cototal Dominating set of graph
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationGlobal Alliance Partition in Trees
Global Alliance Partition in Trees Linda Eroh Department of Mathematics University of Wisconsin Oshkosh, Oshkosh, WI, 54901 eroh@uwoshedu and Ralucca Gera Department of Applied Mathematics Naval Postgraduate
More informationWeak Dynamic Coloring of Planar Graphs
Weak Dynamic Coloring of Planar Graphs Caroline Accurso 1,5, Vitaliy Chernyshov 2,5, Leaha Hand 3,5, Sogol Jahanbekam 2,4,5, and Paul Wenger 2 Abstract The k-weak-dynamic number of a graph G is the smallest
More information(a) (b) Figure 1: Bipartite digraph (a) and solution to its edge-connectivity incrementation problem (b). A directed line represents an edge that has
Incrementing Bipartite Digraph Edge-connectivity Harold N. Gabow Tibor Jordan y Abstract This paper solves the problem of increasing the edge-connectivity of a bipartite digraph by adding the smallest
More informationPlanar Graph Characterization - Using γ - Stable Graphs
Planar Graph Characterization - Using γ - Stable Graphs M. YAMUNA VIT University Vellore, Tamilnadu INDIA myamuna@vit.ac.in K. KARTHIKA VIT University Vellore, Tamilnadu INDIA karthika.k@vit.ac.in Abstract:
More informationThe Connectivity and Diameter of Second Order Circuit Graphs of Matroids
Graphs and Combinatorics (2012) 28:737 742 DOI 10.1007/s00373-011-1074-6 ORIGINAL PAPER The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Jinquan Xu Ping Li Hong-Jian Lai Received:
More informationMath 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 informationModule 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 informationON A WEAKER VERSION OF SUM LABELING OF GRAPHS
ON A WEAKER VERSION OF SUM LABELING OF GRAPHS IMRAN JAVAID, FARIHA KHALID, ALI AHMAD and M. IMRAN Communicated by the former editorial board In this paper, we introduce super weak sum labeling and weak
More informationA Nim game played on graphs II
Theoretical Computer Science 304 (2003) 401 419 www.elsevier.com/locate/tcs A Nim game played on graphs II Masahiko Fukuyama Graduate School of Mathematical Sciences, University of Tokyo, 3-8-1 Komaba,
More informationDiscrete Mathematics. Elixir Dis. Math. 92 (2016)
38758 Available online at www.elixirpublishers.com (Elixir International Journal) Discrete Mathematics Elixir Dis. Math. 92 (2016) 38758-38763 Complement of the Boolean Function Graph B(K p, INC, K q )
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
More informationMC 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 informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationDegree Equitable Domination Number and Independent Domination Number of a Graph
Degree Equitable Domination Number and Independent Domination Number of a Graph A.Nellai Murugan 1, G.Victor Emmanuel 2 Assoc. Prof. of Mathematics, V.O. Chidambaram College, Thuthukudi-628 008, Tamilnadu,
More informationProblem Set 2 Solutions
Problem Set 2 Solutions Graph Theory 2016 EPFL Frank de Zeeuw & Claudiu Valculescu 1. Prove that the following statements about a graph G are equivalent. - G is a tree; - G is minimally connected (it is
More informationMinimum Number of Palettes in Edge Colorings
Graphs and Combinatorics (2014) 30:619 626 DOI 10.1007/s00373-013-1298-8 ORIGINAL PAPER Minimum Number of Palettes in Edge Colorings Mirko Horňák Rafał Kalinowski Mariusz Meszka Mariusz Woźniak Received:
More informationOn graphs with disjoint dominating and 2-dominating sets
On graphs with disjoint dominating and 2-dominating sets 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Mathematics University of Johannesburg Auckland Park, 2006 South Africa Email: mahenning@uj.ac.za
More informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
More informationIndependence Number and Cut-Vertices
Independence Number and Cut-Vertices Ryan Pepper University of Houston Downtown, Houston, Texas 7700 pepperr@uhd.edu Abstract We show that for any connected graph G, α(g) C(G) +1, where α(g) is the independence
More informationGraphs with Two Disjoint Total Dominating Sets
Graphs with Two Disjoint Total Dominating Sets Izak Broere, Rand Afrikaans University Michael Dorfling, Rand Afrikaans University Wayne Goddard, University of Natal Johannes H. Hattingh, Georgia State
More informationarxiv: 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 informationTHE CONNECTED COMPLEMENT DOMINATION IN GRAPHS V.MOHANASELVI 1. Assistant Professor of Mathematics, Nehru Memorial College, Puthanampatti,
THE CONNECTED COMPLEMENT DOMINATION IN GRAPHS V.MOHANASELVI 1 Assistant Professor of Mathematics, Nehru Memorial College, Puthanampatti, Tiruchirappalli-621 00 S.DHIVYAKANNU 2 Assistant Professor of Mathematics,
More informationMatching 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 informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationSome 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 informationDO 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 informationComplete 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 informationHamiltonian 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 informationOn Possible Counterexamples to Negami s Planar Cover Conjecture
On Possible Counterexamples to Negami s Planar Cover Conjecture Petr Hliněný and Robin Thomas School of Mathematics, Georgia Institute of Technology, Atlanta GA 0-00, U.S.A. hlineny@member.ams.org June,
More informationEdge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
Theory and Applications of Graphs Volume 4 Issue 2 Article 2 November 2017 Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles Peter Johnson johnspd@auburn.edu Andrew Owens Auburn
More informationOn 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 informationRay shooting from convex ranges
Discrete Applied Mathematics 108 (2001) 259 267 Ray shooting from convex ranges Evangelos Kranakis a, Danny Krizanc b, Anil Maheshwari a;, Jorg-Rudiger Sack a, Jorge Urrutia c a School of Computer Science,
More informationAn Eternal Domination Problem in Grids
Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger
More informationAugmenting a Graph of Minimum Degree 2 to have Two Disjoint Total Dominating Sets
Augmenting a Graph of Minimum Degree 2 to have Two Disjoint Total Dominating Sets Michael Dorfling a,1 Wayne Goddard b,c Johannes H. Hattingh d Michael A. Henning a,1 a School of Mathematical Sciences,
More informationDomination, 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 informationDO 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 informationLine Graphs and Circulants
Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
More informationNote: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
Note: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination Peter Dankelmann a Michael A. Henning b Wayne Goddard c Renu Laskar d a School of Mathematical Sciences, University of
More informationTHE RESTRAINED EDGE MONOPHONIC NUMBER OF A GRAPH
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(1)(2017), 23-30 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationThe upper open monophonic number of a graph
Proyecciones Journal of Mathematics Vol. 33, N o 4, pp. 389-403, December 2014. Universidad Católica del Norte Antofagasta - Chile The upper open monophonic number of a graph A. P. Santhakumaran and M.
More informationBounds for Support Equitable Domination Number
e-issn 2455 1392 Volume 2 Issue 6, June 2016 pp. 11 15 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Bounds for Support Equitable Domination Number R.Guruviswanathan 1, Dr. V.Swaminathan
More informationSubdivided graphs have linear Ramsey numbers
Subdivided graphs have linear Ramsey numbers Noga Alon Bellcore, Morristown, NJ 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 160 (2012) 505 512 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam 1-planarity of complete multipartite
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationSome 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 informationBounds for the m-eternal Domination Number of a Graph
Bounds for the m-eternal Domination Number of a Graph Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg South Africa mahenning@uj.ac.za Gary MacGillivray Department
More informationChordal probe graphs
Discrete Applied Mathematics 143 (2004) 221 237 www.elsevier.com/locate/dam Chordal probe graphs Martin Charles Golumbic, Marina Lipshteyn Department of Computer Science, Caesarea Rothschild Institute,
More informationRecognizing Interval Bigraphs by Forbidden Patterns
Recognizing Interval Bigraphs by Forbidden Patterns Arash Rafiey Simon Fraser University, Vancouver, Canada, and Indiana State University, IN, USA arashr@sfu.ca, arash.rafiey@indstate.edu Abstract Let
More informationTHE 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 informationApproximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks
Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz and Thomas Erlebach Department of Computer Science University of Leicester University Road, Leicester LE1
More information