DISC6288 MODC+ ARTICLE IN PRESS. Discrete Mathematics ( ) Note. The Ramsey numbers for disjoint unions of trees
|
|
- Mervyn Peregrine Cole
- 6 years ago
- Views:
Transcription
1 PROD. TYPE: COM PP: - (col.fig.: nil) DISC6288 MODC+ ED: Jaya L PAGN: Padmashini -- SCAN: Global Discrete Mathematics ( ) Note The Ramsey numbers for disjoint unions of trees E.T. Baskoro, Hasmawati 2, H. Assiyatun Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung (ITB), Jalan Ganesa 0, Bandung 402, Indonesia Received March 2006; received in revised form 0 May 2006; accepted June Abstract For given graphs G and H, the Ramsey number R(G, H) is the smallest natural number n such that for every graph F of order n: either F contains G or the complement of F contains H. In this paper, we investigate the Ramsey number R( G, H ), where G is a tree and H is a wheel W m or a complete graph K m. We show that if n, then R(kS n,w 4 ) = (k + )n for k 2, even n and R(kS n,w 4 ) = (k + )n for k and odd n. We also show that R( k i= T ni,k m ) = R(T nk,k m ) + k i= n i Published by Elsevier B.V. Keywords: Ramsey number; Star; Wheel; Tree. Introduction For given graphs G and H, the Ramsey number R(G, H) is defined as the smallest positive integer n such that for any graph F of order n, either F contains G or F contains H, where F is the complement of F. In 2, Chvátal and Harary [6] established a useful lower bound for finding the exact Ramsey numbers R(G, H), namely R(G, H) (χ(g) )(c(h ) ) +, where χ(g) is the chromatic number of G and c(h) is the number of vertices of the largest component of H. Since then the Ramsey numbers R(G, H) for many combinations of graphs G and H have been extensively studied by various authors, see a nice survey paper []. Let P n be a path with n vertices and let W m be a wheel of m + vertices that consists of a cycle C m with one additional vertex being adjacent to all vertices of C m.astar S n is the graph on n vertices with one vertex of degree n, called the center, and n vertices of degree. T n is a tree with n vertices and a cocktail-party graph H s is the graph which is obtained by removing s disjoint edges from K 2s. Several results on Ramsey numbers have been obtained for wheels. For instance, Baskoro et al. [] showed that for even m 4 and n (m/2)(m 2), R(P n,w m ) = 2n. They also showed that R(P n,w m ) = n 2 for odd m, and n ((m )/2)(m ). Supported by TWAS Research Grant 04-2 RG-MATHS-AS. 2 Permanent address: Department of Mathematics FMIPA, Universitas Hasanuddin (UNHAS), Jl. Perintis Kemerdekaan Km.0, Makassar 024, Indonesia. addresses: ebaskoro@dns.math.itb.ac.id, ebaskoro@math.itb.ac.id (E.T. Baskoro), hasmawati@math.itb.ac.id (Hasmawati), hilda@math.itb.ac.id (H. Assiyatun) X/$ - see front matter 2006 Published by Elsevier B.V. doi:0.06/j.disc
2 2 E.T. Baskoro et al. / Discrete Mathematics ( ) For a combination of stars with wheels, Surahmat et al. [0] investigated the Ramsey numbers for large stars versus small wheels. Their result is as follows. Theorem (Surahmat and Baskoro [0]). For n, { 2n + if n is even, R(S n,w 4 ) = 2n if n is odd. For odd m, Chen et al. have shown in [4] that R(S n,w m )=n 2 for m and n m. This result was strengthened by Hasmawati et al. in [8], by showing that this Ramsey number remains the same, as given in the following theorem. Theorem 2 (Hasmawati et al. [8]). If m is odd and n ((m + )/2), then R(S n,w m ) = n If n (m + 2)/2, Hasmawati [] gave R(S n,w m ) = n + m 2 for even m and odd n, orr(s n,w m ) = n + m, otherwise. Let G be a graph. The number of vertices in a maximum independent set of G denoted by α 0 (G), and the union of s vertices-disjoint copies of G denoted sg. Burr et al. in [], showed that if the graph G has n vertices and the graph H has n 2 vertices, then n s + n 2 t D R(sG, th) n s + n 2 t D + k, where D = min{sα 0 (G), tα 0 (H )} and k is a constant depending only on G and H. In the following theorem Chvátal gave the Ramsey number for a tree versus a complete graph. Theorem (Chvátal []). For any natural number n and m, R(T n,k m ) = (n )(m ) +. In this paper, we determine the Ramsey numbers R( G, H ) of a disjoint union of a graph G versus a graph H, where G is either a star or a tree, and H is either a wheel or a complete graph. The results are presented in the next three theorems. Theorem 4. If m is odd and n (m + )/2, then R(kS n,w m ) = n 2 + (k )n. Theorem. For n, { (k + )n if n is even and k 2, R(kS n,w 4 ) = (k + )n if n is odd and k. Theorem 6. Let n i n i+ for i =, 2,...,k. If n i (n i n i+ )(m ) for any i, then R( k i= T ni,k m ) = R(T nk,k m ) + k i= n i for an arbitrary m. Before proving the theorems, we present some notations used in this note. Let G(V, E) be a graph. For any vertex v V (G), the neighborhood N(v)is the set of vertices adjacent to v in G. Furthermore, we define N[v]=N(v) {v}. The degree of a vertex v in G is denoted by d G (v). The order of G, G is the number of its vertices, and the minimum (maximum) degree of G is denoted by δ(g)(δ(g)).fors V (G), G[S] represents the subgraph induced by S in G. If G is a graph and H is a subgraph of G, then denote V (G)\V(H)by G\H. Let G =(V,E ) and G 2 =(V 2,E 2 ). The union G=G G 2 has the vertex set V =V V 2 and the edge set E=E E 2. Their join, denoted G + G 2, is the graph with the vertex set V V 2 and the edge set E E 2 {uv : u V,v V 2 }. 2. The proofs of theorems Proof of Theorem 4. Let m be odd and n (m + )/2. We shall use an induction on k. Fork =, we have R(S n,w m )=n 2 (by Theorem 2).Assume the theorem holds for any r<k, namely R(rS n,w m )=(n 2)+(r )n. We will show that R(kS n,w m ) = (n 2) + (k )n.
3 E.T. Baskoro et al. / Discrete Mathematics ( ) V(F ) v v 0 v j A u w Q q 2 X Z q 2 Fig.. The illustration of the proof of R(2S n,w 4 ) n. Let F be a graph with F =n 2 + (k )n. Suppose that F contains no W m. Since F R(rS n,w m ), then F (k )S n. Let A = F \(k )S n and T = F [A]. Thus, T =n 2. Since T contains no W m, then by Theorem 2, T S n. Thus, F contains ks n. Hence, we have R(kS n,w m ) (n 2) + (k )n. On the other hand, it is not difficult to see that F = K kn 2K n contains no ks n and its complement contains no W m. Observe that F has n + (k )n vertices. Therefore, we have R(kS n,w m ) (n 2) + (k )n, and the assertion follows. Proof of Theorem. Let n be even, n 4 and k 2. Consider F = (H (kn 2)/2 + K ) H n/2. Clearly, graph F has (k + )n vertices and contains no ks n. Its complement contains no W 4. Hence, R(kS n,w 4 ) (k + )n. We will prove that R(kS n,w 4 ) = (k + )n for k 2. First we will show that R(2S n,w 4 ) = n. Let F be a graph of order n. Suppose F contains no W 4. By Theorem, we have F S n. Let V(S n ) = {v 0,v,...,v n } with center v 0, A = F \S n and T = F [A]. Thus T =2n. If there exists u T with d T (u) (n ), then T contains S n. Hence F contains 2S n. Therefore we assume that for every vertex u T, d T (u) (n 2). Let u, w T where (u, w) / E(T ). Consider H = N[u] N[w], Q = T \H, Z = N(u) N(w), and X = H \{u, w} (see Fig. ). By contradiction suppose d(u) n. Then 0 Z n, 2 H 2n and 2n 2 Q + Z. Observe that every q Q is adjacent to at least Q 2 other vertices of Q. (Otherwise, there exists q Q which is not adjacent to at least two other vertices of Q, say q and q 2. Then T will contain a W 4 ={q,u,q 2,q,w} with w as a hub, a contradiction). Then, for all q Q, d Q (q) Q 2. Let E(X\Z, Q) ={uv : u X\Z, v Q}. If there exists x X\Z not adjacent to at least two vertices of Q, say q and q 2, then T will contain W 4 ={q,x,q 2,u,w} with w or u as a hub, a contradiction. Hence every x X\Z is adjacent to at least Q vertices in Q. Therefore, we have E(X\Z, Q) X\Z ( Q ). On the other hand, every vertex q Q is incident with at most (n 2) d Q (q) (n 2) ( Q 2) = n Q edges from X\Z. Thus E(X\Z, Q) Q (n Q ). Now, we will show that X\Z ( Q )> Q (n Q ), which leads to a contradiction. Writing X\Z ( Q ) = X\Z Q X\Z and substituting X\Z = 2n 2 Q Z, we obtain X\Z ( Q ) = Q (n Q ) + Q (n 2 Z ) + Q n (n 2 Z ). Noting Q + Z, itcan be verified that Q (n 2 Z ) + Q n (n 2 Z )>0. Thus X\Z ( Q )> Q (n Q ). Hence there is no u T such that d(u) n.
4 4 E.T. Baskoro et al. / Discrete Mathematics ( ) V (F 2 ) 2 S n S k- n Sn v v 2 v (n-) s A' u' w' Q' q q 2 X' Z' Fig. 2. The illustration of the proof of R(kS n,w 4 ) (k + )n. Therefore every vertex u T, d T (u) = n 2. This implies Q =2 + Z. Next, suppose F [Q] is a complete graph. Then for every q Q, d Q (q)= Q. Consequently, every vertex in Q is incident with (n 2) d Q (q)=n Q edges from X\Z. Similarly as in the previous argument, this implies that X\Z ( Q )> Q (n Q ), which is impossible. Hence F [Q] is not a complete graph. Now, choose two vertices in Q which are not adjacent, call q and q 2. Let Y ={q,q 2 } {u, w}, it is clear that Y is an independent set. If there exists a vertex v V(S n ) adjacent to at most one vertex in Y say q, then {v, u, q,q 2,w} will induce a W 4 in F, with a hub w, a contradiction. Therefore, every vertex v V(S n ) is adjacent to at least two vertices in Y. Suppose v 0 and v j in V(S n ) are adjacent to y,y 2 and to y,y 4 in Y, respectively. Note that at least two y i s are distinct. Without loss of generality, assume y = y. Since Y is independent, then we have two new stars, namely S n and S n, where V(S n ) = S n\{v j } {y } with v 0 as the center and V(S n ) = N[y ] {v j } with y as the center (see Fig. ). So, we have F 2S n. Hence, R(2S n,w 4 ) = n. Now, assume the theorem holds for every r<k. We will show that R(kS n,w 4 )=(k +)n. Let F 2 be a graph of order (k +)n. Suppose F 2 contains no W 4. We will show that F 2 ks n. By induction, F 2 (k )S n. Denote the (k )S n as Sn,S2 n,...,sk n with the center v,v 2,...,v k, respectively. Writing A = F 2 \(k )S n and T = F 2 [A ]. Thus T =2n. Similarly, as in the case k=2, every vertex u T, must have degree n 2. Next, let u,w T where (u,w )/ E(T ), H = N[u ] N[w ], Q = T \H, and Y ={q,q 2 } {u,w }, where q,q 2 Q and (q,q 2 )/ E(T ) (see Fig. 2). If the vertex v V ((k )S n ) is adjacent to at most one vertex in Y, say u, then F 2 will contain W 4 = {u,q,v,q 2,w } with w as a hub, a contradiction. Therefore, every vertex v V ((k )S n ) is adjacent to at least two vertices in Y. Suppose v and s in V(S n ) are 2 adjacent to u,q and to u,w, respectively (see Fig. 2). Then, we will alter Sn into S n with V(S n ) = (S n \{s}) {q } and create a new star Sn k where V(Sk n ) = N[u ] {s} with the center u. Hence, we now have k disjoint stars, namely Sn,S2 n,s n,...,sk n and Sn k. Therefore, we have R(kS n,w 4 ) = (k + )n. Let n be odd. Consider F =K kn K n. Clearly, the graph F has order (k +)n 2, without containing ks n and F contains no W 4. Hence, R(kS n,w 4 ) (k + )n. To obtain the Ramsey number we use an induction on k. For k=, we have R(S n,w 4 )=2n. Suppose the theorem holds for every r<k. We show that R(kS n,w 4 )=(k+)n. Let F 4 be a graph of order (k + )n. Suppose F 4 contains no W 4. By the assumption, F 4 contains (k )S n. Let
5 E.T. Baskoro et al. / Discrete Mathematics ( ) B = F 4 \(k )S n and L = F 4 [B]. Thus L =2n. Since L contains no W 4, then by Theorem, L S n. Therefore, F 4 contains ks n. The proof is now complete. 2 2 Proof of Theorem 6. Let n i n i+ and n i (n i n i+ )(m ) for any i. Since F = (m 2)K nk K k i= n i has no k i= T ni and its complement contains no K m, then R( k i= T ni,k m ) (m )(n k ) + k i= n i +. We fix m and apply an induction on k.fork = 2, we show that R(T n T n2,k m ) = (m )(n 2 ) + n +. Let F be a graph with F =(m )(n 2 )++n. Suppose F contains no K m. Since n n 2, then we can write n n 2 =q 0. Substitute n 2 =n q, then we obtain F =(m )(n q )+n +=(m )(n ) q(m )+n + or F =(m )(n ) + +[n (n n 2 )(m )]. Noting n (n n 2 )(m ) 0, it can be verified that F (m )(n ) + i.e. F R(T n,k m ). Hence, F T n.now,leta = F \T n, and H = F [A]. Then H =(m )(n 2 ) +. Since H contains no K m, then by Theorem, H T n2. Therefore, F contains a subgraph T n T n2. Next, assume the theorem holds for all r<k, namely R( r i= T ni,k m )=(m )(n r )+ r i= n i+.we shall show that R( k i= T ni,k m )=(m )(n k )+ k i= n i+.take an arbitrary graph F 2 with order (m )(n k )+ k i= n i+. Suppose F 2 contains no K m. By induction, F 2 contains k i= T n i. Writing B = F 2 \ k i= T n i, and Q = F 2 [B]. Then Q =(m )(n k ) +. Since Q contains no K m, then Q contains T nk. Hence F 2 contains k i= T ni. Therefore, we have R( k i= T ni,k m ) = (m )(n k ) + k i= n i +. The proof is now complete.. Uncited reference [2]. References [] E.T. Baskoro, Surahmat, The Ramsey numbers of path with respect to wheels, Discrete Math. 24 (200). [2] S.A. Burr, On Ramsey numbers for large disjoint unions of graphs, Discrete Math. 0 (88). [] S.A. Burr, P. Erdös, J.H. Spencer, Ramsey theorem for multiple copies of graphs, Trans. Amer. Math. Soc. 20 () 8 8. [4] Y.J. Chen, Y.Q. Zhang, K.M. Zhang, The Ramsey numbers of stars versus wheels, European J. Combin. (2004) [] V. Chvátal, Tree-complete graph Ramsey number, J. Graph Theory (). [6] V. Chvátal, F. Harary, Generalized Ramsey theory for graphs, III: small off-diagonal numbers, Pacific. J. Math. 4 (2) 4. [] Hasmawati, Bilangan Ramsey untuk graf bintang terhadap graf roda, Tesis Magister, Departemen Matematika ITB Indonesia, [8] Hasmawati, E.T. Baskoro, H. Assiyatun, Star-wheel Ramsey numbers, J. Combin. Math. Conbin. Comput. (200) 28. [] S.P. Radziszowski, Small Ramsey numbers, Electron. J. Combin. July (2004) #DS. [0] Surahmat, E.T. Baskoro, On the Ramsey number of a path or a star versus W 4 or W, in: Proceedings of the 2th Australasian Workshop on Combinatorial Algorithms, Bandung, Indonesia, July 4 200, pp. 6 0.
arxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
More informationAn Exact Formula for all Star-Kipas Ramsey Numbers
Graphs and Combinatorics 017) 33:141 148 DOI 10.1007/s00373-016-1746-3 ORIGINAL PAPER An Exact Formula for all Star-Kipas Ramsey Numbers Binlong Li 1, Yanbo Zhang 3,4 Hajo Broersma 3 Received: June 015
More informationarxiv: v1 [math.co] 3 Mar 2015 University of West Bohemia
On star-wheel Ramsey numbers Binlong Li Department of Applied Mathematics Northwestern Polytechnical University Xi an, Shaanxi 710072, P.R. China Ingo Schiermeyer Institut für Diskrete Mathematik und Algebra
More informationOn the Union of Graphs Ramsey Numbers
Applied Mathematical Sciences, Vol. 8, 2014, no. 16, 767-773 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.311641 On the Union of Graphs Ramsey Numbers I Wayan Sudarsana Combinatorial
More informationTHE LOCATING-CHROMATIC NUMBER OF DISCONNECTED GRAPHS
Far East Journal of Mathematical Sciences (FJMS) 2014 Pushpa Publishing House, Allahabad, India Published Online: December 2014 Available online at http://pphmj.com/journals/fjms.htm Volume 94, Number
More informationOn the Ramsey number of 4-cycle versus wheel
Indonesian Journal of Combinatorics 1 (1) (2016), 9 21 On the Ramsey number of 4-cycle versus wheel Enik Noviani, Edy Tri Baskoro Combinatorial Mathematics Research Group Faculty of Mathematics and Natural
More informationOn the Ramsey-Goodness of Paths
Graphs and Combinatorics (016) 3:541 549 DOI 10.1007/s00373-016-171-z ORIGINAL PAPER On the Ramsey-Goodness of Paths Binlong Li 1, Halina Bielak 3 Received: 8 July 015 / Revised: 1 February 016 / Published
More informationTurán s problem and Ramsey numbers for trees. Zhi-Hong Sun 1, Lin-Lin Wang 2 and Yi-Li Wu 3
Colloquium Mathematicum 139(015, no, 73-98 Turán s problem and Ramsey numbers for trees Zhi-Hong Sun 1, Lin-Lin Wang and Yi-Li Wu 3 1 School of Mathematical Sciences, Huaiyin Normal University, Huaian,
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationarxiv: v1 [math.co] 23 Nov 2015
arxiv:1511.07306v1 [math.co] 23 Nov 2015 RAMSEY NUMBERS OF TREES AND UNICYCLIC GRAPHS VERSUS FANS MATTHEW BRENNAN Abstract. The generalized Ramsey number R(H, K) is the smallest positive integer n such
More informationAKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS
Reprinted from AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS AKCE Int. J. Graphs Comb., 10, No. 3 (2013), pp. 317-325 The partition dimension for a subdivision of homogeneous caterpillars Amrullah,
More informationOn Generalized Ramsey Numbers
On Generalized Ramsey Numbers Wai Chee Shiu, Peter Che Bor Lam and Yusheng Li Abstract Let f 1 and f 2 be graph parameters. The Ramsey number rf 1 m; f 2 n is defined as the minimum integer N such that
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationDiscrete Mathematics. The edge spectrum of the saturation number for small paths
Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for
More informationClosing the gap on path-kipas Ramsey numbers
Closing the gap on path-kipas Ramsey numbers We dedicate this paper to the memory of Ralph Faudree, one of the exponents of Ramsey theory who died on January 13, 2015 Department of Mathematics University
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationarxiv: v2 [math.co] 26 Apr 2014
Super edge-magic deficiency of join-product graphs arxiv:1401.45v [math.co] 6 Apr 014 A.A.G. Ngurah 1 Department of Civil Engineering Universitas Merdeka Malang Jalan Taman Agung No. 1 Malang, Indonesia
More informationConditional colorings of graphs
Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
More informationINDUCED CYCLES AND CHROMATIC NUMBER
INDUCED CYCLES AND CHROMATIC NUMBER A.D. SCOTT DEPARTMENT OF MATHEMATICS UNIVERSITY COLLEGE, GOWER STREET, LONDON WC1E 6BT Abstract. We prove that, for any pair of integers k, l 1, there exists an integer
More informationConnectivity of graphs with given girth pair
Discrete Mathematics 307 (2007) 155 162 www.elsevier.com/locate/disc Connectivity of graphs with given girth pair C. Balbuena a, M. Cera b, A. Diánez b, P. García-Vázquez b, X. Marcote a a Departament
More informationOn (a, d)-vertex-antimagic total labeling of Harary graphs
On (a, d)-ertex-antimagic total labeling of Harary graphs M. Hussain 1, Kashif Ali 1, M. T. Rahim, Edy Tri Baskoro 3 1 COMSATS Institute of Information Technology, Lahore Campus, Pakistan {muhammad.hussain,kashif.ali}@ciitlahore.edu.pk
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationLocating Chromatic Number of Banana Tree
International Mathematical Forum, Vol. 12, 2017, no. 1, 39-45 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.610138 Locating Chromatic Number of Banana Tree Asmiati Department of Mathematics
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
More informationMarkov chains, graph spectra, and some static/dynamic scaling limits
Markov chains, graph spectra, and some static/dynamic scaling limits Akihito Hora Hokkaido University I will talk about how I began to get interested in spectra of graphs and then was led to beautiful
More informationSuper edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications 5 () (017), 1 0 Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah a, Rinovia Simanjuntak b a Department of Civil
More informationOn (Super) Edge-Magic Total Labeling of Subdivision of K 1,3
SUT Journal of Mathematics Vol. 43, No. (007), 17 136 On (Super) Edge-Magic Total Labeling of Subdivision of K 1,3 Anak Agung Gede Ngurah, Rinovia Simanjuntak and Edy Tri Baskoro (Received August 31, 006)
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationTHE LOCATING-CHROMATIC NUMBER FOR CERTAIN OF TREES
Bulletin of Mathematics ISSN Printed: 2087-5126; Online: 2355-8202 Vol. 08, No. 02 (2016), pp.125-131 http://jurnal.bull-math.org THE LOCATING-CHROMATIC NUMBER FOR CERTAIN OF TREES Asmiati Abstract. The
More informationRepresentations of disjoint unions of complete graphs
Discrete Mathematics 307 (2007) 1191 1198 Note Representations of disjoint unions of complete graphs Anthony B. Evans Department of Mathematics and Statistics, Wright State University, Dayton, OH, USA
More informationThe metric dimension of regular bipartite graphs
Bull. Math. Soc. Sci. Math. Roumanie Tome 54(10) No. 1, 011, 15 8 The metric dimension of regular bipartite graphs by M. Bača, E.T. Baskoro, A.N.M. Salman, S.W. Saputro, D. Suprijanto Abstract A set of
More informationUnicyclic Ramsey (mk 2, P n )-Minimal Graphs
Unicyclic Ramsey (mk 2, P n )-Minimal Graphs 1 Kristiana Wijaya, 2 Edy Tri Baskoro and 2 Hilda Assiyatun 1 Department of Mathematics, Universitas Jember, 1,2 Combinatorial Mathematics Research Group, Institut
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationSaturation numbers for Ramsey-minimal graphs
Saturation numbers for Ramsey-minimal graphs Martin Rolek and Zi-Xia Song Department of Mathematics University of Central Florida Orlando, FL 3816 August 17, 017 Abstract Given graphs H 1,..., H t, a graph
More informationInduced subgraphs of graphs with large chromatic number. I. Odd holes
Induced subgraphs of graphs with large chromatic number. I. Odd holes Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544,
More informationGraph homomorphism into an odd cycle
Graph homomorphism into an odd cycle Hong-Jian Lai West Virginia University, Morgantown, WV 26506 EMAIL: hjlai@math.wvu.edu Bolian Liu South China Normal University, Guangzhou, P. R. China EMAIL: liubl@hsut.scun.edu.cn
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationProper connection number and 2-proper connection number of a graph
Proper connection number and 2-proper connection number of a graph arxiv:1507.01426v2 [math.co] 10 Jul 2015 Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
More informationarxiv: v1 [math.co] 5 Sep 2016
Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep
More informationTough graphs and hamiltonian circuits
Discrete Mathematics 306 (2006) 910 917 www.elsevier.com/locate/disc Tough graphs and hamiltonian circuits V. Chvátal Centre de Recherches Mathématiques, Université de Montréal, Montréal, Canada Abstract
More informationThe structure of bull-free graphs I three-edge-paths with centers and anticenters
The structure of bull-free graphs I three-edge-paths with centers and anticenters Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised March 29, 2011 Abstract The bull is the
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
More informationCommunicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S
Transactions on Combinatorics ISSN print: 2251-8657, ISSN on-line: 2251-8665 Vol. 01 No. 2 2012, pp. 49-57. c 2012 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON THE VALUES OF INDEPENDENCE
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationA Study on Ramsey Numbers and its Bounds
Annals of Pure and Applied Mathematics Vol. 8, No. 2, 2014, 227-236 ISSN: 2279-087X (P), 2279-0888(online) Published on 17 December 2014 www.researchmathsci.org Annals of A Study on Ramsey Numbers and
More informationEQUITABLE COLORING OF SPARSE PLANAR GRAPHS
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationLower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 7, no. 6, pp. 67 688 (03 DOI: 0.755/jgaa.003 Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
More informationBounds on Shannon Capacity and Ramsey Numbers from Product of Graphs
Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Xiaodong Xu Guangxi Academy of Sciences Nanning, Guangxi 530007, China xxdmaths@sina.com and Stanis law P. Radziszowski Department of
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationk-tuple Domatic In Graphs
CJMS. 2(2)(2013), 105-112 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 k-tuple Domatic In Graphs Adel P. Kazemi 1 1 Department
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationUniversity of Alabama in Huntsville Huntsville, AL 35899, USA
EFFICIENT (j, k)-domination Robert R. Rubalcaba and Peter J. Slater,2 Department of Mathematical Sciences University of Alabama in Huntsville Huntsville, AL 35899, USA e-mail: r.rubalcaba@gmail.com 2 Department
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More informationSATURATION SPECTRUM OF PATHS AND STARS
1 Discussiones Mathematicae Graph Theory xx (xxxx 1 9 3 SATURATION SPECTRUM OF PATHS AND STARS 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 Jill Faudree Department of Mathematics and Statistics University of
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn the Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
More informationA LIFTING OF GRAPHS TO 3-UNIFORM HYPERGRAPHS, ITS GENERALIZATION, AND FURTHER INVESTIGATION OF HYPERGRAPH RAMSEY NUMBERS
A LIFTING OF GRAPHS TO 3-UNIFORM HYPERGRAPHS, ITS GENERALIZATION, AND FURTHER INVESTIGATION OF HYPERGRAPH RAMSEY NUMBERS A thesis presented to the faculty of the Graduate School of Western Carolina University
More informationOn the partition dimension of two-component graphs
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 127, No. 5, November 2017, pp. 755 767. https://doi.org/10.1007/s12044-017-0363-2 On the partition dimension of two-component graphs D O HARYENI 1,,ETBASKORO 1,
More informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationOn Modular Colorings of Caterpillars
On Modular Colorings of Caterpillars Futaba Okamoto Mathematics Department University of Wisconsin - La Crosse La Crosse, WI 546 Ebrahim Salehi Department of Mathematical Sciences University of Nevada
More informationDouble domination edge removal critical graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 285 299 Double domination edge removal critical graphs Soufiane Khelifi Laboratoire LMP2M, Bloc des laboratoires Université demédéa Quartier
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
More informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
More informationInduced Graph Ramsey Theory
Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue Chicago, Illinois 60604, USA schaefer@cs.depaul.edu February 27, 2001 Pradyut Shah Department of Computer
More informationOn size multipartite Ramsey numbers for stars versus paths and cycles
Electroic Joural of Graph Theory ad Applicatios 5 (1) (2017), 4 50 O size multipartite Ramsey umbers for stars versus paths ad cycles Aie Lusiai 1, Edy Tri Baskoro, Suhadi Wido Saputro Combiatorial Mathematics
More informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More information