Discrete Applied Mathematics
|
|
- Theodore Gavin Thomas
- 5 years ago
- Views:
Transcription
1 Discrete Applied Matheatics 7 (009) Contents lists available at ScienceDirect Discrete Applied Matheatics journal hoepage: Equitable total coloring of C C n Tong Chunling ab Lin Xiaohui a Yang Yuansheng a Li Zhihe a a Departent of Coputer Science and Engineering Dalian University of Technology Dalian 60 PR China b Departent of Inforation Science and Engineering Shandong Jiaotong University Jinan 00 PR China a r t i c l e i n f o a b s t r a c t Article history: Received 6 May 007 Received in revised for 8 August 008 Accepted August 008 Available online Septeber 008 The equitable total chroatic nuber of a graph G is the sallest integer k for which G has a k-total coloring such that the nuber of vertices and edges colored with each color differs by at ost one. In this paper we show that the Cartesian product graphs of C and C n have equitable total -coloring for all and n. 008 Elsevier B.V. All rights reserved. Keywords: Total coloring Equitable total coloring Equitable total chroatic nuber Cycle Cartesian product. Introduction We consider only finite undirected graphs without loops or ultiple edges. Let G = (V(G) E(G)) be a graph with vertex set V and edge set E. A k-total coloring of a graph G is a coloring of the vertices and edges of G with k colors so that no two adjacent or incident eleents have the sae color. The total chroatic nuber χ (G) of G is the sallest k such that G has a k-total coloring. A total coloring is equitable if the nuber of vertices and edges colored with each color differs by at ost one. The sallest k for which G has such a coloring is naed equitable total chroatic nuber and denoted by χ = (G). There is a long -standing Total Coloring Conjecture (TCC) forulated by Behzad [] and Vizing [] independently which says that (G) + χ (G) (G) + for a siple graph G. Sánchez-Arroyo [] has shown that deciding χ (G) is NP-coplete. McDiarid and Sánchez-Arroyo [0] have shown that deterining the total chroatic nuber of k-regular bipartite graphs is NP-hard for each fixed k too. TCC has been verified for several classes of graphs in recent years [697]. Kostochka [8] proved that the total coloring of any ultigraph with axial degree is 6-total colorable. Fu [] first investigated the equitable total coloring. He raised Conjecture. and proved it for a few special cases such as trees coplete graphs coplete bipartite graphs coplete split graphs and graphs G with (G) V(G). Conjecture.. For any graph G G has an equitable total k-coloring for each k ax(χ (G) (G) + ). Wang [6] put forward Conjecture. and proved it for all ultigraphs G with (G). Conjecture.. For any graph G χ = (G) (G) +. Research supported by NFSC (6070). Corresponding author. Tel.: E-ail address: yangys@dlut.edu.cn (Y. Yang) X/$ see front atter 008 Elsevier B.V. All rights reserved. doi:0.06/j.da
2 C. Tong et al. / Discrete Applied Matheatics 7 (009) Fig... C C. Zhang [9] obtained the equitable total chroatic nuber of soe join graphs. The Cartesian product G H of two graphs G and H is the graph with vertex set V(G) V(H) in which the vertex (a b) is adjacent to the vertex (c d) whenever a = c and b is adjacent to d or b = d and a is adjacent to c. Let C and C n be cycles of length and n respectively the Cartesian product C C n is a -regular graph with n vertices v ij 0 i n and 0 j where indices i and j are read odulo n and respectively. Fig.. shows C C. A lot of work has been done on the total chroatic nuber of Cartesian product graphs [78]. Seoud et al. [] proved that χ (C C n ) = + for and n being an even nuber or a ultiple of. Kenitz and Marangio [7] further proved that χ (C C n ) = + holds for and n being a ultiple of too. Baril et al. [] proved that any Cartesian product of cycles has an adjacent vertex distinguishing chroatic index equal to + i.e. that the graph is type by the observation ade in [] and also in [0]. In this paper we will show that χ = (C C n ) = + = for all and n.. Equitable total -coloring of C C n Now we consider the coloring of C C n. We have Theore.. C C n has equitable total -coloring for all and n. Proof. By syetry we need only consider the cases for od n od. Let V = {v ij : 0 i n 0 j } E = {v ij v ij+ : 0 i n 0 j } E n = {v ij v i+j : 0 i n 0 j } where indices i and j are read odulo n and respectively. Let β = β = β = β = β =. Let σ be a coloring of C C n as follows: Case. 0 od. Sv = β β β β β Se = β β β β β Se n = β β β β β. Case.. n 0 od (see Fig..()). σ (V) = (Sv ) n σ (E ) = (Se ) n σ (E n ) = (Se n ) n.
3 98 C. Tong et al. / Discrete Applied Matheatics 7 (009) Fig... σ (C C n ) for n {{ } { } { } {6 6} {7 7}}. Case.. n od. σ (V) = (Sv ) n 6 σ (E ) = (Se ) n 6 σ (E n ) = (Se n ) n 6 Case.. n od. σ (V) = (Sv ) n σ (E ) = (Se ) n σ (E n ) = (Se n ) n Case.. n od. σ (V) = (Sv ) n σ (E ) = (Se ) n σ (E n ) = (Se n ) n β β β β β β β β β β β β β β β β β. β β β β β β. β β β β β β β β β.
4 C. Tong et al. / Discrete Applied Matheatics 7 (009) Case.. n od. σ (V) = (Sv ) n σ (E ) = (Se ) n σ (E n ) = (Se n ) n Case. od. β β β β β β β β β β β β. Sv = β 6 β 6 β 6 β 6 β 6 Se = β 6 β 6 β 6 β 6 β 6 Se n = β 6 β 6 β 6 β 6 β 6. Case.. n od (see Fig..()). σ (V) = (Sv ) n 6 6 β σ (E ) = (Se ) n 6 σ (E n ) = (Se n ) n 6 Case.. n od. σ (V) = (Sv ) n 7 β 6 β 6 β 6 β 6 β 6 6 β 6 β 6 β σ (E ) = (Se ) n 7 σ (E n ) = (Se n ) n 7 Case.. n od. Case... n =. β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6. β 6 β 6 β 6 β 6 β 6 β 6 6 β 6 β β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6 β 6. σ (V) = β 6 β 6 β 6 σ (E ) = () 6 () 6 () 6 σ (E n ) = () 6 () 6 () 6. Case... n 8. σ (V) = (Sv ) n 8 6 β β 6 β 6 β 6 β 6 β 6 β 6 β 6 σ (E ) = (Se ) n 8 6 β β 6 β 6 β 6 β 6 β 6 β 6 β 6 σ (E n ) = (Se n ) n 8 6 β β 6 β 6 β 6 β 6 β 6 β β 6. Case.. n od. σ (V) = (Sv ) n 6 β σ (E ) = (Se ) n σ (E n ) = (Se n ) n β 6 β 6 β 6 β 6 β β 6 β 6 β 6 β 6 β 6 β 6.
5 600 C. Tong et al. / Discrete Applied Matheatics 7 (009) Case. od. Sv = β β 7 β 7 β 7 β Se = β 7 β 7 β β 7 β 7 Se n = β 7 β 7 β 7 β 7 β. Case.. n od (see Fig..()). σ (V) = (Sv ) n 7 σ (E ) = (Se ) n 7 σ (E n ) = (Se n ) n 7 Case.. n od. Case... n =. σ (V) = β β β 7 7 β 7 β β 7 β 7 β 7 β β 7 β β 7 β 7 β β 7 β β 7 β 7 β 7 β β 7 σ (E ) = β 7 β 7 β 7 σ (E n ) = β Case... n 8. β 7 β 7. σ (V) = (Sv ) n 8 β β 7 β 7 β 7 β 7 β 7 β 7 β σ (E ) = (Se ) n 8 7 β β 7 σ (E n ) = (Se n ) n 8 Case.. n od. Case... n =. 7 β β 7 σ (V) = β 7 β β 7 β 7 β 7 β 7 β β 7 β 7 β 7 β 7 β β 7 β. β 7 β σ (E ) = β 7 β 7 β 7 β 7 σ (E n ) = β Case... n 9. β 7 σ (V) = (Sv ) n β 7 β 7. 7 β σ (E ) = (Se ) n σ (E n ) = (Se n ) n Case. od. β β β 7 7 β β β β 7 β β 7 β β Sv = β β β β β Se = β β β β β Se n = β β β β β.. β 7 β 7 β.
6 C. Tong et al. / Discrete Applied Matheatics 7 (009) Case.. n od (see Fig..()). σ (V) = (Sv ) n β σ (E ) = (Se ) n σ (E n ) = (Se n ) n Case.. n od. σ (V) = (Sv ) n β β β β β σ (E ) = (Se ) n σ (E n ) = (Se n ) n β β β β. β β β β β β β β β β β. Case. od and n od (see Fig..()). Sv = β β β β β Se = β β β β β Se n = β β β β β. σ (V) = (Sv ) n β σ (E ) = (Se ) n σ (E n ) = (Se n ) n β β β β β β β β β β β. Clearly σ is a -total coloring of C C n. Now we take Case for exaple to verify that σ is an equitable total -coloring of C C n. Let T(C C n ) = (T T T T T ) where T i denotes the i-th color class of σ. Since T = T = T = (n+)/ and T = T = (n )/ we have T i T j ( i < j ) for Case. Siilarly we have T i T j ( i < j ) for all other Cases. Hence σ is an equitable total -coloring of C C n. Acknowledgeents We are very grateful to the referees for their careful reading with corrections and useful coents. References [] J.L. Baril H. Kheddouci O. Togni Adjacent vertex distinguishing edge-colorings of eshes Australas. J. Cobin. (006) [] M. Behzad Graphs and their chroatic nubers Ph.D. Thesis Michigan State University 96. [] C.N. Capos C.P. de Mello A result on the total colouring of powers of cycles Discrete Appl. Math. (007) [] K. Edwards M. Horňák M. Woźniak On the neighbour-distinguishing index of a graph Graphs Cobin. () (006) 0. [] Hung-lin Fu Soe results on equalized total coloring Congr. Nuer. 0 (99) 9. [6] A.J.W. Hilton Ji-ping Liu Cheng Zhao The total chroatic nubers of joins of sparse graphs Australas. J. Cobin. 8 (00) 9 0. [7] A. Kenitz M. Marangio Total colorings of Cartesian products of graphs Congr. Nuer. 6 (00) [8] A.V. Kostochka The total coloring of a ultigraph with axial degree Discrete Math. 7 (977) 6 6. [9] Guang-rong Li Li-in Zhang Total chroatic nuber of one kind of join graphs Discrete Math. 06 (006) [0] C.J.H. McDiarid A. Sánchez-Arroyo Deterining the total colouring nuber is NP-hard Discrete Math. (99) 6. [] M.A. Seoud Total chroatic nubers Appl. Math. Lett. (6) (99) 7 9. [] M.A. Seoud A.E.I. Abd el Maqsoud R.J. Wilson J. Willias Total colourings of Cartesian products Int. J. Math. Educ. Sci.Technol. 8 (997) [] A. Sánchez-Arroyo Total colouring regular bipartite graphs is NP-hard Discrete Math. 78 (989) 9. [] V.G. Vizing Soe unsolved probles in graph theory Uspehi Mat. Nauk. (968) 7. [] Shu-dong Wang Shan-chen Pang The deterination of the total chroatic nuber of series-parallel graphs with (G) Graphs Cobin. (00) 0. [6] Wei-fan Wang Equitable total coloring of graphs with axiu degree Graphs Cobin. 8 (00) [7] Wei-fan Wang The total chroatic nuber of planar graphs with axiu degree ten J. Graph theory. (007) 9 0. [8] Yi-xian Yang hua-ping Liu Fangc-hun Yang Zhong-fu Zhang Total chroatic nuber of Cartesian products Math. Appl. () (999) 08. [9] Zhong-fu Zhang On the equitable total colorings of soe join graphs J. Infor. Coput Sci. () (00) [0] Zhong-fu Zhang Xiang-en Chen Jing-wen Li Bian Liang Peng-xiang Qiu A note on the relation of adjacent strong edge coloring and total coloring of graphs 006 (subitted for publication). [] B. Zazek J. Zerovnik Behzad-Vizing conjecture and Cartesian product graphs Electron. Notes Discrete Math. 7 (00) [] M. Zwonek A note on total colourings of digraphs Discrete Math. 06 (006) 8 9.
Infinitely Many Trees Have Non-Sperner Subtree Poset
Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October
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 informationNeighbor-distinguishing k-tuple edge-colorings of graphs
Neighbor-distinguishing k-tuple edge-colorings of graphs Jean-Luc Baril and Olivier Togni 1 LEI UMR-CNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJON-Cedex France e-mail: {barjl,olivier.togni}@u-bourgogne.fr
More informationMANY physical structures can conveniently be modelled
Proceedings of the World Congress on Engineering Coputer Science 2017 Vol II Roly r-orthogonal (g, f)-factorizations in Networks Sizhong Zhou Abstract Let G (V (G), E(G)) be a graph, where V (G) E(G) denote
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 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 informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More information1. INTRODUCTION AND RESULTS
SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00
More informationA Note on Revised Szeged Index of Graph Operations
Iranian J Math Che 9 (1) March (2018) 57 63 Iranian Journal of Matheatical Cheistry Journal hoepage: ijckashanuacir A Note on Revised Szeged Index of Graph Operations NASRIN DEHGARDI Departent of Matheatics
More informationThe concavity and convexity of the Boros Moll sequences
The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:
More informationAn EGZ generalization for 5 colors
An EGZ generalization for 5 colors David Grynkiewicz and Andrew Schultz July 6, 00 Abstract Let g zs(, k) (g zs(, k + 1)) be the inial integer such that any coloring of the integers fro U U k 1,..., g
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationA total coloring of a graph G in an assignment of colors to the vertices and edges of G such that no two adjacent or incident
International Journal of Scientific and Research Publications, Volume 7, Issue 7, July 2017 616 Total Coloring of Closed Helm, Flower and Bistar Graph Family R. ARUNDHADHI *, V. ILAYARANI ** * Department
More informationADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE. Weifan Wang and Yiqiao Wang
TAIWANESE JOURNAL OF MATHEMATICS Vol. 12, No. 4, pp. 979-990, July 2008 This paper is available online at http://www.tjm.nsysu.edu.tw/ ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER
More informationSpectral radius of bipartite graphs
Linear Algebra and its Applications 474 2015 30 43 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Spectral radius of bipartite graphs Chia-an
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
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 informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS
#A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno
More informationOriented vertex and arc colorings of outerplanar graphs
Information Processing Letters 100 (2006) 97 104 www.elsevier.com/locate/ipl Oriented vertex and arc colorings of outerplanar graphs Alexandre Pinlou,1, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours
More informationAcyclic Colorings of Directed Graphs
Acyclic Colorings of Directed Graphs Noah Golowich Septeber 9, 014 arxiv:1409.7535v1 [ath.co] 6 Sep 014 Abstract The acyclic chroatic nuber of a directed graph D, denoted χ A (D), is the iniu positive
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 informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
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 informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationMaximum graphs with a unique minimum dominatingset
Discrete Mathematics 60 (003) 197 03 www.elsevier.com/locate/disc Note Maximum graphs with a unique minimum dominatingset Miranca Fischermann, Dieter Rautenbach ;1, Lutz Volkmann Lehrstuhl II fur Mathematik,
More informationThe spectral radius of edge chromatic critical graphs
The spectral radius of edge chromatic critical graphs Lihua Feng b, Jianxiang Cao c, Weijun Liu a,b, Shifeng Ding b, Henry Liu b a School of Science, Nantong University, Nantong, Jiangshu, 6019, China.
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 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 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 informationON SOME PROBLEMS OF GYARMATI AND SÁRKÖZY. Le Anh Vinh Mathematics Department, Harvard University, Cambridge, Massachusetts
#A42 INTEGERS 12 (2012) ON SOME PROLEMS OF GYARMATI AND SÁRKÖZY Le Anh Vinh Matheatics Departent, Harvard University, Cabridge, Massachusetts vinh@ath.harvard.edu Received: 12/3/08, Revised: 5/22/11, Accepted:
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.
M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x
More informationNote on generating all subsets of a finite set with disjoint unions
Note on generating all subsets of a finite set with disjoint unions David Ellis e-ail: dce27@ca.ac.uk Subitted: Dec 2, 2008; Accepted: May 12, 2009; Published: May 20, 2009 Matheatics Subject Classification:
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 informationAverage degrees of edge-chromatic critical graphs
Average degrees of edge-chromatic critical graphs Yan Cao a,guantao Chen a, Suyun Jiang b,c, Huiqing Liu d, Fuliang Lu e a Department of Mathematics and Statistics, Georgia State University, Atlanta, GA
More informationPRELIMINARIES This section lists for later sections the necessary preliminaries, which include definitions, notations and lemmas.
MORE O SQUARE AD SQUARE ROOT OF A ODE O T TREE Xingbo Wang Departent of Mechatronic Engineering, Foshan University, PRC Guangdong Engineering Center of Inforation Security for Intelligent Manufacturing
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 informationEquitable Coloring On Mycielskian Of Wheels And Bigraphs
Applied Mathematics E-Notes, 1(201), 174-182 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Equitable Coloring On Mycielskian Of Wheels And Bigraphs Kaliraj Kalimuthu,
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 informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationOn balanced colorings of sparse hypergraphs
On balanced colorings of sparse hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu January 21, 2014 Abstract We investigate 2-balanced colorings
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 157 (2009) 2978 2982 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note Characterizations of competition
More informationThe irregularity strength of circulant graphs
Discrete Mathematics 30 (00) 0 www.elsevier.com/locate/disc The irregularity strength of circulant graphs J.-L. Baril, H. Kheddouci, O. Togni LEI, UMR CNRS 8, Université de Bourgogne, BP 7870, 078 Dijon
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 informationLONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES
Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,
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 informationA Study on B-Spline Wavelets and Wavelet Packets
Applied Matheatics 4 5 3-3 Published Online Noveber 4 in SciRes. http://www.scirp.org/ournal/a http://dx.doi.org/.436/a.4.5987 A Study on B-Spline Wavelets and Wavelet Pacets Sana Khan Mohaad Kaliuddin
More informationarxiv: v1 [math.co] 15 Nov 2018
arxiv:1811.0617v1 [ath.co] 15 Nov 018 Forbidden rainbow subgraphs that force large onochroatic or ulticolored connected subgraphs Xihe Li a,b and Ligong Wang a,b, a Departent of Applied Matheatics, School
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationOn the oriented chromatic index of oriented graphs
On the oriented chromatic index of oriented graphs Pascal Ochem, Alexandre Pinlou, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours de la Libération 33405 Talence Cedex, France February 19, 2006 Abstract
More informationarxiv: v2 [math.co] 6 Sep 2016
Acyclic chromatic index of triangle-free -planar graphs Jijuan Chen Tao Wang Huiqin Zhang Institute of Applied Mathematics Henan University, Kaifeng, 475004, P. R. China arxiv:504.06234v2 [math.co] 6 Sep
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 informationPolytopes and arrangements: Diameter and curvature
Operations Research Letters 36 2008 2 222 Operations Research Letters wwwelsevierco/locate/orl Polytopes and arrangeents: Diaeter and curvature Antoine Deza, Taás Terlaky, Yuriy Zinchenko McMaster University,
More informationEdge-face colouring of plane graphs with maximum degree nine
Edge-face colouring of plane graphs with maximum degree nine Jean-Sébastien Sereni Matěj Stehlík Abstract An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
More informationMidterm 1 Sample Solution
Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationLow complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
Inforation Processing Letters 107 008 11 15 www.elsevier.co/locate/ipl Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
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 informationThe chromatic number and the least eigenvalue of a graph
The chromatic number and the least eigenvalue of a graph Yi-Zheng Fan 1,, Gui-Dong Yu 1,, Yi Wang 1 1 School of Mathematical Sciences Anhui University, Hefei 30039, P. R. China fanyz@ahu.edu.cn (Y.-Z.
More informationarxiv: v1 [math.co] 17 Apr 2018
On extremal cacti with respect to the edge revised Szeged index arxiv:180.06009v1 [math.co] 17 Apr 2018 Shengjie He a, Rong-Xia Hao a, Deming Li b a Department of Mathematics, Beijing Jiaotong University,
More informationThe adjacent vertex-distinguishing total chromatic number of 1-tree
The adjacent ertex-distinguishing total chromatic number of 1-tree Haiying Wang The School of Information Engineering China Uniersity of Geosciences(Beijing) Beijing 100083, P.R.China Abstract Let G =
More informationJudicious partitions and related problems
Judicious partitions and related probles Alex Scott Abstract Many classical partitioning probles in cobinatorics ask for a single quantity to be axiized or iniized over a set of partitions of a cobinatorial
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 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 informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationOn Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs. Enqiang Zhu*, Chanjuan Liu and Jin Xu
TAIWANESE JOURNAL OF MATHEMATICS Vol. xx, No. x, pp. 4, xx 20xx DOI: 0.650/tjm/6499 This paper is available online at http://journal.tms.org.tw On Adjacent Vertex-distinguishing Total Chromatic Number
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 informationChih-Hung Yen and Hung-Lin Fu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 273-286, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ LINEAR 2-ARBORICITY OF THE COMPLETE GRAPH Chih-Hung Yen and Hung-Lin
More informationITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N ( ) 528
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 40 2018 528 534 528 SOME OPERATOR α-geometric MEAN INEQUALITIES Jianing Xue Oxbridge College Kuning University of Science and Technology Kuning, Yunnan
More informationHandout 6 Solutions to Problems from Homework 2
CS 85/185 Fall 2003 Lower Bounds Handout 6 Solutions to Probles fro Hoewor 2 Ait Charabarti Couter Science Dartouth College Solution to Proble 1 1.2: Let f n stand for A 111 n. To decide the roerty f 3
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationNumerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda
Journal of Math-for-Industry, Vol. 3 (C-), pp. Nuerically repeated support splitting and erging phenoena in a porous edia equation with strong absorption To the eory of y friend Professor Nakaki. Kenji
More informationStatistics and Probability Letters
Statistics and Probability Letters 79 2009 223 233 Contents lists available at ScienceDirect Statistics and Probability Letters journal hoepage: www.elsevier.co/locate/stapro A CLT for a one-diensional
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 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 informationMore on Zagreb Coindices of Composite Graphs
International Mathematical Forum, Vol. 7, 2012, no. 14, 669-673 More on Zagreb Coindices of Composite Graphs Maolin Wang and Hongbo Hua Faculty of Mathematics and Physics Huaiyin Institute of Technology
More informationBipanconnectivity of Cartesian product networks
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 46 (2010), Pages 297 306 Bipanconnectivity of Cartesian product networks You Lu Jun-Ming Xu Department of Mathematics University of Science and Technology of
More informationINDEPENDENT SETS IN HYPERGRAPHS
INDEPENDENT SETS IN HYPERGRAPHS Abstract. Many iportant theores and conjectures in cobinatorics, such as the theore of Szeerédi on arithetic progressions and the Erdős-Stone Theore in extreal graph theory,
More informationON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS
Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by
More informationErdős-Gallai-type results for the rainbow disconnection number of graphs
Erdős-Gallai-type results for the rainbow disconnection number of graphs Xuqing Bai 1, Xueliang Li 1, 1 Center for Combinatorics and LPMC arxiv:1901.0740v1 [math.co] 8 Jan 019 Nankai University, Tianjin
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationStrong edge-colouring of sparse planar graphs
Strong edge-colouring of sparse planar graphs Julien Bensmail a, Ararat Harutyunyan b, Hervé Hocquard a, Petru Valicov c a LaBRI (Université de Bordeaux), 351 cours de la Libération, 33405 Talence Cedex,
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 informationChoice Numbers of Multi-Bridge Graphs
Computer Science Journal of Moldova, vol.25, no.3(75), 2017 Julian Allagan Benkam Bobga Abstract Suppose ch(g) and χ(g) denote, respectively, the choice number and the chromatic number of a graph G = (V,E).
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 informationSummary for lectures: MCS 361
Suary for lectures: MCS 361 Discrete Matheatics, Fall 2016 36568 LCD - undergrad MWF 1:00-1:50, TH 309 Instructor: Shuel Friedland Office: 715 SEO, phone: 413-2150, e:ail: friedlan@uic.edu web: //www.ath.uic.edu/
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationAn Improved F-Expansion Method and Its Application to Coupled Drinfel d Sokolov Wilson Equation
Commun. Theor. Phys. (Beijing, China) 50 (008) pp. 309 314 c Chinese Physical Society Vol. 50, No., August 15, 008 An Improved F-Expansion Method and Its Application to Coupled Drinfel d Sokolov Wilson
More informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 2108 2118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc An oriented coloring of planar graphs with girth at
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationSUPERCONGRUENCES INVOLVING PRODUCTS OF TWO BINOMIAL COEFFICIENTS
Finite Fields Al. 013, 4 44. SUPERCONGRUENCES INVOLVING PRODUCTS OF TWO BINOMIAL COEFFICIENTS Zhi-Wei Sun Deartent of Matheatics, Nanjing University Nanjing 10093, Peole s Reublic of China E-ail: zwsun@nju.edu.cn
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 informationHypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2
Hypergraphs not containing a tight tree with a bounded trunk II: -trees with a trunk of size Zoltán Füredi Tao Jiang Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte July 6, 08 Abstract A tight r-tree
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationOn splitting digraphs
On splitting digraphs arxiv:707.03600v [math.co] 0 Apr 08 Donglei Yang a,, Yandong Bai b,, Guanghui Wang a,, Jianliang Wu a, a School of Mathematics, Shandong University, Jinan, 5000, P. R. China b Department
More information