The L(2, 1)-labeling on the skew and converse skew products of graphs
|
|
- Bryce Underwood
- 6 years ago
- Views:
Transcription
1 Applied Mathematics Letters 20 (2007) The L(2, 1)-labeling on the skew and converse skew products of graphs Zhendong Shao a,,rogerk.yeh b, David Zhang c a Department of Computer Science and Technology, Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, , PR China b Department of Applied Mathematics, Feng Chia University, Taichung 40724, Taiwan c Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong Received 10 February 2006; accepted 13 February 2006 Abstract An L(2, 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that f (x) f (y) 2 if d(x, y) = 1 and f (x) f (y) 1 if d(x, y) = 2, where d(x, y) denotes the distance between x and y in G. TheL(2, 1)-labeling number λ(g) of G is the smallest number k such that G has an L(2, 1)-labeling with max{ f (v) : v V (G)} =k. Griggs and Yeh conjecture that λ(g) Δ 2 for any simple graph with maximum degree Δ 2. This work considers the graph formed by the skew product and the converse skew product of two graphs. As corollaries, the new graph satisfies the above conjecture (with minor exceptions). c 2006 Elsevier Ltd. All rights reserved. Keywords: Channel assignment; L(2, 1)-labeling; Graph skew product; Graph converse skew product 1. Introduction The frequency assignment problem is to assign a frequency to each radio transmitter so that interfering transmitters are assigned frequencies whose separation is not in a set of disallowed separations. Hale [10] formulated this into a graph vertex coloring problem. In a private communication with Griggs, Roberts proposed a variation of the channel assignment problem in which close transmitters must receive different channels and very close transmitters must receive channels that are at least two channels apart. To translate the problem into the language of graph theory, the transmitters are represented by the vertices of a graph; two vertices are very close if they are adjacent and close if they are of distance two in the graph. Motivated by this problem, Yeh [19] and then Griggs and Yeh [9] proposed the following labeling on a simple graph. An L(2, 1)-labeling of a graph G is a function f fromthe vertexset V (G) to the set ofall nonnegative integers such that f (x) f (y) 2ifd(x, y) = 1and f (x) f (y) 1ifd(x, y) = 2, where d(x, y) denotes the distance between x and y in G. A k-l(2, 1)-labeling is an L(2, 1)-labeling such that no label is greater than k. The L(2, 1)-labeling number of G, denoted by λ(g), is the smallest number k such that G has a k-l(2, 1)-labeling. Corresponding author. addresses: zhdshao0026@126.com (Z. Shao), rkyeh@math.fcu.edu.tw (R.K. Yeh), csdzhang@comp.polyu.edu.hk (D. Zhang) /$ - see front matter c 2006 Elsevier Ltd. All rights reserved. doi: /j.aml
2 60 Z. Shao et al. / Applied Mathematics Letters 20 (2007) There are a considerable articles studying the L(2, 1)-labelings (see [1 9,11 16,18,19]). Most of the papers consider the values of λ on particular classes of graphs. Griggs and Yeh [9] provided an upper bound Δ 2 + 2Δ for a general graph with the maximum degree Δ. Later, Chang and Kuo [4] improved the bound to Δ 2 + Δ. Recently, Král and Skrekovski [12] reduced the bound to Δ 2 + Δ 1. If G is a diameter 2 graph, then λ(g) Δ 2. The upper bound is attainable by Moore graphs (diameter 2 graph with order Δ 2 + 1). (Such graphs exist only if Δ = 2, 3, 7, and possibly 57; cf. [9].) Thus Griggs and Yeh [9] conjectured that the best bound is Δ 2 for any graph G with the maximum degree Δ 2(cf.[9]). (This is not true for Δ = 1. For example, Δ(K 2 ) = 1butλ(K 2 ) = 2.) Determining the value of λ is proved to be NP-complete (cf. [9]). Graph products play an important role in connecting many useful networks. In [16], we consider the graph formed by the cartesian product and the composition of graphs and prove that the L(2, 1)-labeling number of the graph is bounded by the square of its maximum degree and hence Griggs and Yeh s conjecture holds in both cases (with minor exceptions). In this work, we study the graph formed by the skew product and the converse skew product. As corollaries, the L(2, 1)-labeling number of the graph is bounded by the square of its maximum degree. Griggs and Yeh s conjecture holds in both cases (with minor exceptions). 2. A labeling algorithm A subset X of V (G) is called an i-stable set (or i-independent set) if the distance between any two vertices in X is greater than i. A 1-stable (independent) set is a usual independent set. A maximal 2-stable subset X of a set Y is a 2-stable subset of Y such that X is not a proper subset of any 2-stable subset of X. Chang and Kuo[4] proposedthe following algorithmfor obtaining an L(2, 1)-labeling and the maximum value of that labeling on a given graph. Algorithm 2.1. Input: AgraphG = (V, E). Output: The value k is the maximum label. Idea: In each step, find a maximal 2-stable set from these unlabeled vertices that are distance 2 away from those vertices labeled in the previous step. Then label all vertices in that 2-stable subset with the index i in the current stage. The index i starts from 0 and then increases by 1 in each step. The maximum label k is the final value of i. Initialization: Set X 1 = ; V = V (G); i = 0. Iteration: 1. Determine Y i and X i. Y i ={x V : x is unlabeled and d(x, y) 2forally X i 1 }. X i a maximal 2-stable subset of Y i. If Y i = then set X i =. 2. Label those vertices in X i (if there are any) with i. 3. V V \ X i. 4. V,theni i + 1; go to Step Record the currenti as k (which is the maximum label). Stop. Thus k is an upper bound on λ(g). We would like to find a bound in terms of the maximum degree Δ(G) of G analogous to the bound in terms of the chromatic number χ(g). Let x be a vertex with the largest label k obtained by Algorithm 2.1. Define I 1 ={i : 0 i k 1andd(x, y) = 1forsomey X i }, I 2 ={i : 0 i k 1andd(x, y) 2forsomey X i }, I 3 ={i : 0 i k 1andd(x, y) 3forally X i }. It is clear that I 2 + I 3 =k. For any i I 3, x Y i ;otherwisex i {x} is a 2-stable subset of Y i, which contradicts the choice of X i.thatis, d(x, y) = 1forsomevertexy in X i 1 ; i.e., i 1 I 1.So, I 3 I 1. Hence k I 2 + I 3 I 2 + I 1.
3 Z. Shao et al. / Applied Mathematics Letters 20 (2007) Fig. 1. (Skew) product of two graphs. Fig. 2. (Converse skew) product of two graphs. In order to find k, it suffices to estimate B = I 1 + I 2 in terms of Δ(G). We will investigate the value of B with respect to a particular graph. For convenience, the notation which has been introduced in this section will also be used in the following section. 3. The skew and converse skew products of graphs Graph products have an important role in constructing many useful networks. Shibata and Kikuchi [17] put forward two interesting graph products called the skew product and converse skew product, respectively, based on the distance in graphs. The two graph products are defined as follows: each product of graphs G and H has vertex set V (G) V (H ). The skew product: G H has edge set E(G) ={((u 1, u 2 ), (v 1,v 2 )) [u 1 = v 1 and u 2 v 2 E(G 2 )] or [u 1 v 1 E(G 1 ) and u 2 v 2 E(G 2 )]}.(SeeFig. 1 for an example.) The converse skew product: G H has edge set E(G) ={((u 1, u 2 ), (v 1,v 2 )) [u 2 = v 2 and u 1 v 1 E(G 1 )] or [u 1 v 1 E(G 1 ) and u 2 v 2 E(G 2 )]}.(SeeFig. 2 for an example.) By the definition of the skew product G H of two graphs G and H,ifΔ(G) = 0orΔ(H ) = 0, then G H is disjoint copies of H or empty. Therefore we assume Δ(G) 1andΔ(H ) 1. In this section, we obtain an upper bound in terms of the maximum degree of G H for any two graphs G and H. Theorem 3.1. Let Δ, Δ 1, Δ 2 be the maximum degree of G H, G, H respectively. Then λ(g H ) Δ 2 + Δ 1 Δ 2 + Δ 2 Δ 1 (Δ 1 1)(Δ 2 1) Δ 2 (Δ 2 1)Δ 1. Proof. Let x = (u,v) in V (G) V (H ). Thendeg G H (x) = deg G (u)deg H (v) + deg H (v). Defined = deg G H, d 1 = deg G (u), d 2 = deg H (v), Δ 1 = Δ(G) and Δ 2 = Δ(H ). Hence d = d 1 d 2 + d 2 and Δ = Δ(G H ) = Δ 1 Δ 2 + Δ 2. (See Fig. 3 for this paragraph. In Fig. 3, d(v) denotes the degree of v in H,i.e.,d(v) = d 2.) For any vertex u in G with distance 2 from u, there must be a path u u u of length 2 between u and u in G; butthedegreeofv in H is d 2,i.e.,v has d 2 adjacent vertices in H, and so by the definition of a strong product G H, there must be d 2 internally disjoint paths of length 2 between (u,v)and (u,v). Hence for any vertex in G with distance 2 from u, there must be corresponding d 2 vertices with distance 2 from x = (u,v)which coincide in G H ;butthereared 1 (d 1 1) vertices
4 62 Z. Shao et al. / Applied Mathematics Letters 20 (2007) Fig. 3. Fig. 4. with distance 2 from u in G, and hence in this sense the number of vertices with distance 2 from x = (u,v)in G H will decrease d 1 (d 1 1)(d 2 1) from the value d(δ 1) (the number d(δ 1) is the best possible). (See Fig. 4 for the following proof. In Fig. 4, d(u) denotes the degree of u in G, i.e., d(u) = d 1.) For any vertex v in H with distance 2 from v, there must be a path v v v of length 2 between v and v in H ;butthedegreeofu in G is d 1, i.e., u has d 1 adjacent vertices in G, and so by the definition of a skew product G H, there must be d internally disjoint paths of length 2 between (u,v ) and (u,v) in G H. Hence for any vertex in H with distance 2 from v, there must be corresponding d vertices in G H with distance 2 from x = (u,v) which coincide in G H ;butthereared 2 (d 2 1) vertices with distance 2 from v in H, and hence in this sense the number of vertices with distance 2 from x = (u,v)in G H will decrease d 2 (d 2 1)(d ) = d 2 (d 2 1)d 1 from the value d(δ 1) (the number d(δ 1) is the best possible). Hence the number of vertices with distance 2 from x = (u,v)in G H will decrease d 1 (d 1 1)(d 2 1) + d 2 (d 2 1)d 1 from the value d(δ 1) altogether.
5 Z. Shao et al. / Applied Mathematics Letters 20 (2007) Hence for the vertex x, the number of vertices with distance 1 from x is no greater than Δ. The number of vertices with distance 2 from x is no greater than d(δ 1) d 1 (d 1 1)(d 2 1) d 2 (d 2 1)d 1. Hence I 1 d, I 2 d + d(δ 1) d 1 (d 1 1)(d 2 1) d 2 (d 2 1)d 1 = dδ d 1 (d 1 1)(d 2 1) d 2 (d 2 1)d 1. Then B = I 1 + I 2 d + dδ d 1 (d 1 1)(d 2 1) d 2 (d 2 1)d 1 = d(δ + 1) d 1 (d 1 1)(d 2 1) d 2 (d 2 1) d 1 = (d 1 d 2 + d 2 )(Δ 1 Δ 2 + Δ 2 + 1) d 1 (d 1 1)(d 2 1) d 2 (d 2 1)d 1.Define f (s, t) = (st + t)(δ 1 Δ 2 + Δ 2 + 1) s(s 1)(t 1) t(t 1)s. Then f (s, t) has the absolute maximum at (Δ 1, Δ 2 ) on [0, Δ 1 ] [0, Δ 2 ]; f (Δ 1, Δ 2 ) = (Δ 1 Δ 2 + Δ 2 )(Δ 1 Δ 2 + Δ 2 + 1) Δ 1 (Δ 1 1)(Δ 2 1) Δ 2 (Δ 2 1)Δ 1 = Δ(Δ + 1) Δ 1 (Δ 1 1)(Δ 2 1) Δ 2 (Δ 2 1)Δ 1 = Δ 2 + Δ Δ 1 (Δ 1 1)(Δ 2 1) Δ 2 (Δ 2 1)Δ 1. Then λ(g H ) k B Δ 2 + Δ Δ 1 (Δ 1 1)(Δ 2 1) Δ 2 (Δ 2 1)Δ 1 = Δ 2 + Δ 1 Δ 2 + Δ 2 Δ 1 (Δ 1 1) (Δ 2 1) Δ 2 (Δ 2 1)Δ 1. Corollary 3.2. Let Δ be the maximum degree of G H. Then λ(g H ) Δ 2 except for when one of Δ(G) and Δ(H ) is 1. Proof. For Δ 1 (Δ 1 1)(Δ 2 1) + Δ 2 (Δ 2 1)Δ 1 Δ 1 Δ 2 Δ 2 = Δ 1 (Δ 1 1)(Δ 2 1) + Δ 2 (Δ 2 1)(Δ ) Δ 1 Δ 2 Δ 2 = Δ 1 (Δ 1 1)(Δ 2 1) + Δ 2 (Δ 2 1)(Δ 1 1) + Δ 2 (Δ 2 1) Δ 1 Δ 2 Δ 2 = (Δ 1 + Δ 2 )(Δ 2 1)(Δ 1 1) + Δ 2 (Δ 2 1) Δ 1 Δ 2 Δ 2. But Δ 1 Δ 2 = (Δ 1 1)(Δ 2 1) + Δ 1 + Δ 2 1. Hence (Δ 1 + Δ 2 )(Δ 2 1)(Δ 1 1) + Δ 2 (Δ 2 1) Δ 1 Δ 2 Δ 2 = (Δ 1 + Δ 2 )(Δ 2 1)(Δ 1 1) + Δ 2 (Δ 2 1) ((Δ 1 1)(Δ 2 1) + Δ 1 + Δ 2 1) Δ 2 = (Δ 1 + Δ 2 1)(Δ 2 1)(Δ 1 1) + Δ 2 (Δ 2 1) (Δ 1 + Δ 2 1) Δ 2 = (Δ 1 + Δ 2 1)((Δ 2 1)(Δ 1 1) 1) + Δ 2 (Δ 2 2). If one of Δ 1 or Δ 2 is 1 then G H is still a general graph. Hence we can suppose Δ 1 2andΔ 2 2. Then Δ 1 (Δ 1 1)(Δ 2 1) + Δ 2 (Δ 2 1)Δ 1 Δ 1 Δ 2 Δ 2 = (Δ 1 + Δ 2 1)((Δ 2 1)(Δ 1 1) 1) + Δ 2 (Δ 2 2) 0. This implies λ(g H ) Δ 2 + Δ 1 Δ 2 + Δ 2 Δ 1 (Δ 1 1)(Δ 2 1) Δ 2 (Δ 2 1)Δ 1 Δ 2. Therefore the results follow. By the definitions of the skew product G H and the converse skew product G H, the two products have symmetric structures. Hence we can obtain an upper bound in terms of the maximum degree of G H for any two graphs G and H similarly. Theorem 3.3. Let Δ, Δ 1, Δ 2 be the maximum degrees of G H, G, H respectively. Then λ(g H ) Δ 2 + Δ 1 Δ 2 + Δ 1 Δ 2 (Δ 2 1)(Δ 1 1) Δ 1 (Δ 1 1)Δ 2. Corollary 3.4. Let Δ be the maximum degree of G H. Then λ(g H ) Δ 2 except for when one of Δ(G) and Δ(H ) is 1. Acknowledgment The second author was supported in part by the National Science Council under grant NSC M References [1] H.L. Bodlaender, T. Kloks, R.B. Tan, J.v. Leeuwen, λ-coloring of Graphs, in: Lecture Notes in Computer Science, vol. 1770, Springer-Verlag, Berlin, Heidelberg, 2000, pp
6 64 Z. Shao et al. / Applied Mathematics Letters 20 (2007) [2] A.A. Bertossi, C.M. Pinotti, Mapping for conflict-free access of path in bidimensional arrays, circular lists, and complete trees, J. Parallel Distrib. Comput. 62 (2002) [3] G.J. Chang, W.-T. Ke, D. Kuo, D.D.-F. Liu, R.K. Yeh, On L(d, 1)-labelings of graphs, Discrete Math. 220 (2000) [4] G.J. Chang, D. Kuo, The L(2, 1)-labeling on graphs, SIAM J. Discrete Math. 9 (1996) [5] J. Fiala, T. Kloks, J. Kratochví l, Fixed-Parameter Complex of λ-labelings, in: Lecture Notes in Computer Science, vol. 1665, Springer-Verlag, Berlin, Heidelberg, 1999, pp [6] J. Georges, D.W. Mauro, Generalized vertex labelings with a condition at distance two, Congr. Numer. 109 (1995) [7] J. Georges, D.W. Mauro, M.I. Stein, Labeling products of complete graphs with a condition at distance two, SIAM J. Discrete Math. 14 (2000) [8] J. Georges, D.W. Mauro, M. Whittlesey, Relating path covering to vertex labelings with a condition at distance two, Discrete Math. 135 (1994) [9] J.R. Griggs, R.K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Discrete Math. 5 (1992) [10] W.K. Hale, Frequency assignment: Theory and application, Proc. IEEE 68 (1980) [11] P.K. Jha, A. Narayanan, P. Sood, K. Sundaram, V. Sunder, On L(2, 1)-labeling of the Cartesian product of a cycle and a path, Ars Combin. 55 (2000) [12] D. Král, R. Skrekovski, A theorem about channel assignment problem, SIAM J. Discrete Math. 16 (3) (2003) [13] D. Kuo, J.-H. Yan, On L(2, 1)-labeling of Cartesian products of paths and cycles, Discrete Math. 283 (1 3) (2004) [14] D.D.-F. Liu, R.K. Yeh, On distance-two labelings of graphs, Ars Combin. 47 (1997) [15] D. Sakai, Labeling chordal graphs with a condition at distance two, SIAM J. Discrete Math. 7 (1994) [16] Z. Shao, R.K. Yeh, The L(2, 1)-labeling and operations of graphs, IEEE Trans. Circuits & Systems I: Regular Papers 52 (2005) [17] Y. Shibata, Y. Kikuchi, Graph products based on the distance in graphs, IEICE Trans. Fundamentals 3 (E83-A) (2000) [18] M. Whittlesey, J. Georges, D.W. Mauro, On the λ-number of Q n and related graphs, SIAM J. Discrete Math. 8 (1995) [19] R.K. Yeh, Labelling graphs with a condition at distance two, Ph.D. Thesis, Dept. of Math., Univ. of South Carolina, Columbia, SC, USA, Further reading [1] F.S. Roberts, T-colorings of graphs: Recent results and open problems, Discrete Math. 93 (1991)
The L(3, 2, 1)-labeling on the Skew and Converse Skew Products of Graphs
Advances in Theoretical and Applied Mathematics. ISSN 0973-4554 Volume 11, Number 1 (2016), pp. 29 36 Research India Publications http://www.ripublication.com/atam.htm The L(3, 2, 1)-labeling on the Skew
More informationImproved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR AERS VOL. ***, NO. ***, *** 2007 Improed Bounds on the L(2, )-Number of Direct and Strong roducts of Graphs Zhendong Shao, Sandi Klažar, Daid Zhang,
More informationThe L(2, 1)-labeling on β-product of Graphs
International Journal on Data Science and Technology 018; 4(): 54-59 http://wwwsciencepublishinggroupcom/j/ijdst doi: 1011648/jijdst01804013 ISSN: 47-00 (Print); ISSN: 47-35 (Online) The L(, 1)-labeling
More informationRadio Number for Square Paths
Radio Number for Square Paths Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003 Melanie Xie Department of Mathematics East Los Angeles College Monterey
More informationMultilevel Distance Labelings for Paths and Cycles
Multilevel Distance Labelings for Paths and Cycles Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles Los Angeles, CA 90032, USA Email: dliu@calstatela.edu Xuding Zhu
More informationDistance Two Labeling of Some Total Graphs
Gen. Math. Notes, Vol. 3, No. 1, March 2011, pp.100-107 ISSN 2219-7184; Copyright c ICSRS Publication, 2011 www.i-csrs.org Available free online at http://www.geman.in Distance Two Labeling of Some Total
More informationL(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs
MATEMATIKA, 2014, Volume 30, Number 2, 109-116 c UTM Centre for Industrial and Applied Mathematics L(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs Murugan Muthali Tamil Nadu Open University
More informationA Channel Assignment Problem [F. Roberts, 1988]
1 2 A Channel Assignment Problem [F. Roberts, 1988] Find an efficient assignment of channels f(x) R to sites x R 2 so { that two levels of interference are avoided: 2d if x y A f(x) f(y) d if x y 2A 1.1
More informationAntipodal Labelings for Cycles
Antipodal Labelings for Cycles Justie Su-Tzu Juan and Daphne Der-Fen Liu Submitted: December 2006; revised: August 2007 Abstract Let G be a graph with diameter d. An antipodal labeling of G is a function
More informationL(3, 2, 1)-LABELING FOR CYLINDRICAL GRID: THE CARTESIAN PRODUCT OF A PATH AND A CYCLE. Byeong Moon Kim, Woonjae Hwang, and Byung Chul Song
Korean J. Math. 25 (2017), No. 2, pp. 279 301 https://doi.org/10.11568/kjm.2017.25.2.279 L(3, 2, 1)-LABELING FOR CYLINDRICAL GRID: THE CARTESIAN PRODUCT OF A PATH AND A CYCLE Byeong Moon Kim, Woonjae Hwang,
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
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 informationSpectral radii of graphs with given chromatic number
Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationSome results on incidence coloring, star arboricity and domination number
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 54 (2012), Pages 107 114 Some results on incidence coloring, star arboricity and domination number Pak Kiu Sun Wai Chee Shiu Department of Mathematics Hong
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 informationarxiv: v1 [math.co] 29 Jul 2010
RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS PAUL MARTINEZ, JUAN ORTIZ, MAGGY TOMOVA, AND CINDY WYELS arxiv:1007.5346v1 [math.co] 29 Jul 2010 Abstract. A radio labeling is an assignment c : V (G) N such
More informationTHE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2
LE MATEMATICHE Vol LXVIII (2013) Fasc II, pp 167 190 doi: 104418/201368213 THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2 K F BENSON - M PORTER - M TOMOVA A radio labeling of a simple connected
More informationA Note on Radio Antipodal Colourings of Paths
A Note on Radio Antipodal Colourings of Paths Riadh Khennoufa and Olivier Togni LEI, UMR 5158 CNRS, Université de Bourgogne BP 47870, 1078 Dijon cedex, France Revised version:september 9, 005 Abstract
More informationGraph Labellings with Variable Weights, a Survey
Graph Labellings with Variable Weights, a Survey Jerrold R. Griggs a,1 Daniel Král b,2 a Department of Mathematics, University of South Carolina, Columbia, SC 29208 USA. E-mail: griggs@math.sc.edu. b Department
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationA characterisation of eccentric sequences of maximal outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(3) (2014), Pages 376 391 A characterisation of eccentric sequences of maximal outerplanar graphs P. Dankelmann Department of Mathematics University of Johannesburg
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 informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
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 informationThe NP-Hardness of the Connected p-median Problem on Bipartite Graphs and Split Graphs
Chiang Mai J. Sci. 2013; 40(1) 8 3 Chiang Mai J. Sci. 2013; 40(1) : 83-88 http://it.science.cmu.ac.th/ejournal/ Contributed Paper The NP-Hardness of the Connected p-median Problem on Bipartite Graphs and
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 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 informationNeighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs
Acta Mathematica Sinica, English Series Feb., 2015, Vol. 31, No. 2, pp. 216 224 Published online: January 15, 2015 DOI: 10.1007/s10114-015-4114-y Http://www.ActaMath.com Acta Mathematica Sinica, English
More informationT -choosability in graphs
T -choosability in graphs Noga Alon 1 Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. and Ayal Zaks 2 Department of Statistics and
More informationL(2, 1, 1)-Labeling Is NP-Complete for Trees
L(2, 1, 1)-Labeling Is NP-Complete for Trees Petr A. Golovach 1, Bernard Lidický 2, and Daniël Paulusma 3 1 University of Bergen, Bergen, Norway 2 University of Illinois, Urbana, USA 3 University of Durham,
More informationOn Injective Colourings of Chordal Graphs
On Injective Colourings of Chordal Graphs Pavol Hell 1,, André Raspaud 2, and Juraj Stacho 1 1 School of Computing Science, Simon Fraser University 8888 University Drive, Burnaby, B.C., Canada V5A 1S6
More informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 49 502 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc 2-distance ( + 2)-coloring of planar graphs with girth
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 informationTheoretical Computer Science
Theoretical Computer Science 532 (2014) 64 72 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Bandwidth consecutive multicolorings
More informationComplexity of Locally Injective k-colourings of Planar Graphs
Complexity of Locally Injective k-colourings of Planar Graphs Jan Kratochvil a,1, Mark Siggers b,2, a Department of Applied Mathematics and Institute for Theoretical Computer Science (ITI) Charles University,
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 note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
More informationLower bounds on the minus domination and k-subdomination numbers
Theoretical Computer Science 96 (003) 89 98 www.elsevier.com/locate/tcs Lower bounds on the minus domination and k-subdomination numbers Liying Kang a;, Hong Qiao b, Erfang Shan a, Dingzhu Du c a Department
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 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 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 informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More informationLabeling Graphs with a Condition at Distance 2
University of South Carolina Scholar Commons Faculty Publications Mathematics, Department of 11-1992 Labeling Graphs with a Condition at Distance 2 Jerrold R. Griggs University of South Carolina - Columbia,
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 informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationOn a list-coloring problem
On a list-coloring problem Sylvain Gravier Frédéric Maffray Bojan Mohar December 24, 2002 Abstract We study the function f(g) defined for a graph G as the smallest integer k such that the join of G with
More informationSOME RESULTS ON THE DISTANCE r-b-coloring IN GRAPHS
TWMS J. App. Eng. Math. V.6, N.2, 2016, pp. 315-323 SOME RESULTS ON THE DISTANCE r-b-coloring IN GRAPHS G. JOTHILAKSHMI 1, A. P. PUSHPALATHA 1, S. SUGANTHI 2, V. SWAMINATHAN 3, Abstract. Given a positive
More informationRainbow Matchings of Size δ(g) in Properly Edge-Colored Graphs
Rainbow Matchings of Size δ(g) in Properly Edge-Colored Graphs Jennifer Diemunsch Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, and Paul S. Wenger Abstract A rainbow matching in an edge-colored
More informationThe Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
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 informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationOn the Gutman index and minimum degree
On the Gutman index and minimum degree Jaya Percival Mazorodze 1 Department of Mathematics University of Zimbabwe, Harare, Zimbabwe mazorodzejaya@gmail.com Simon Mukwembi School of Mathematics, Statistics
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 the second Laplacian eigenvalues of trees of odd order
Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,
More informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationIntegrity in Graphs: Bounds and Basics
Integrity in Graphs: Bounds and Basics Wayne Goddard 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 USA and Henda C. Swart Department of Mathematics, University of
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 informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationEquitable Colorings of Corona Multiproducts of Graphs
Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
More informationDistance in Graphs - Taking the Long View
AKCE J Graphs Combin, 1, No 1 (2004) 1-13 istance in Graphs - Taking the Long View Gary Chartrand 1 and Ping Zhang 2 epartment of Mathematics, Western Michigan University, Kalamazoo, MI 49008, USA 1 e-mail:
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 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 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 informationARTICLE IN PRESS Discrete Applied Mathematics ( )
Discrete Applied Mathematics ( ) Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Forwarding index of cube-connected cycles Jun Yan a,
More informationOn Brooks Coloring Theorem
On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, 26505 Abstract Let G be a connected finite simple graph. δ(g), (G) and
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 informationA Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs
A Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs Ruo-Wei Hung Department of Information Management Nan-Kai Institute of Technology, Tsao-Tun, Nantou 54, Taiwan rwhung@nkc.edu.tw
More informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
More informationMulti-colouring the Mycielskian of Graphs
Multi-colouring the Mycielskian of Graphs Wensong Lin Daphne Der-Fen Liu Xuding Zhu December 1, 016 Abstract A k-fold colouring of a graph is a function that assigns to each vertex a set of k colours,
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationarxiv: v1 [math.co] 7 Nov 2018
DP-4-COLORABILITY OF TWO CLASSES OF PLANAR GRAPHS LILY CHEN 1 AND RUNRUN LIU 2 AND GEXIN YU 2, AND REN ZHAO 1 AND XIANGQIAN ZHOU 1,4 arxiv:1811.02920v1 [math.co] Nov 2018 1 School of Mathematical Sciences,
More informationk-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationCircular Chromatic Numbers of Some Reduced Kneser Graphs
Circular Chromatic Numbers of Some Reduced Kneser Graphs Ko-Wei Lih Institute of Mathematics, Academia Sinica Nankang, Taipei 115, Taiwan E-mail: makwlih@sinica.edu.tw Daphne Der-Fen Liu Department of
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationCircular choosability of graphs
Circular choosability of graphs Xuding Zhu Department of Applied Mathematics National Sun Yat-sen University Kaohsiung, Taiwan zhu@math.nsysu.edu.tw Abstract This paper discusses the circular version of
More informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
More informationDegree Sequence and Supereulerian Graphs
Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph
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 informationMINIMAL RANKINGS OF THE CARTESIAN PRODUCT K n K m
Discussiones Mathematicae Graph Theory 32 (2012) 725 735 doi:10.7151/dmgt.1634 MINIMAL RANKINGS OF THE CARTESIAN PRODUCT K n K m Gilbert Eyabi (1), Jobby Jacob (2), Renu C. Laskar (3) Darren A. Narayan
More informationRADIO NUMBER FOR CROSS PRODUCT P n (P 2 ) Gyeongsang National University Jinju, , KOREA 2,4 Department of Mathematics
Iteratioal Joural of Pure ad Applied Mathematics Volume 97 No. 4 014, 515-55 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v97i4.11
More informationAdjacent Vertex Distinguishing Colorings of Graphs
Adjacent Vertex Distinguishing Colorings of Graphs Wang Weifan Department of Mathematics Zhejiang Normal University Jinhua 321004 Page. 1 Total 80 Our Page. 2 Total 80 1 Let G = (V, E) be a simple graph.
More informationResearch Article L(2, 1)-Labeling of the Strong Product of Paths and Cycles
e Scientific World Journal Volume, Article ID 3, pages http://dx.doi.org/.//3 Research Article L(, )-Labeling of the Strong Product of Paths and Cycles Zehui Shao, and Aleksander Vesel 3 School of Information
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 informationON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS
ON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS OLGA VARGHESE Abstract. Graph products and Coxeter groups are defined via vertex-edge-labeled graphs. We show that if the graph has a special shape, then
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationThe smallest Randić index for trees
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 123, No. 2, May 2013, pp. 167 175. c Indian Academy of Sciences The smallest Randić index for trees LI BINGJUN 1,2 and LIU WEIJUN 2 1 Department of Mathematics,
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationDP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES
DP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES RUNRUN LIU 1 AND XIANGWEN LI 1 AND KITTIKORN NAKPRASIT 2 AND PONGPAT SITTITRAI 2 AND GEXIN YU 1,3 1 School of Mathematics & Statistics,
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationList backbone coloring of paths and cycles
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 66(3) (2016), Pages 378 392 List backbone coloring of paths and cycles Wannapol Pimpasalee Department of Mathematics, Faculty of Science Khon Kaen University
More informationC-Perfect K-Uniform Hypergraphs
C-Perfect K-Uniform Hypergraphs Changiz Eslahchi and Arash Rafiey Department of Mathematics Shahid Beheshty University Tehran, Iran ch-eslahchi@cc.sbu.ac.ir rafiey-ar@ipm.ir Abstract In this paper we define
More information