The irregularity strength of circulant graphs
|
|
- Giles Phillips
- 5 years ago
- Views:
Transcription
1 Discrete Mathematics 30 (00) 0 The irregularity strength of circulant graphs J.-L. Baril, H. Kheddouci, O. Togni LEI, UMR CNRS 8, Université de Bourgogne, BP 7870, 078 Dijon cedex, France Received 3 July 00; received in revised form September 00; accepted 7 September 00 Abstract The irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of the vertices are distinct. In this paper we study the irregularity strength of circulant graphs of degree. We find the exact value of the strength for a large family of circulant graphs. 00 Elsevier B.V. All rights reserved. Keywords: Graph; Labeling; Irregularity strength; Circulant graph. Introduction and definitions All the graphs we deal with are undirected, simple and connected. Let G = (V, E) be a graph with vertex set V and edge set E. A function w : E Z + is called a weighting of G, and for an edge e E, w(e) is called the weight of e. The strength s(w) of w is defined as s(w) = max e E w(e). The weighted degree of a vertex x V is the sum of the weights of its incident edges: d w (x) = e x w(e). The irregularity strength s(g) of G is defined as s(g) = min{s(w), w is an irregular weighting of G}. The study of s(g) was initiated by Chartrand et al. [3] and has proven to be difficult in general. There are not many graphs for which the irregularity strength is known. For an overview of the subject, the reader is referred to the survey of Lehel [8] and recent papers [7,,,9,]. addresses: barjl@u-bourgogne.fr (J.-L. Baril), kheddouc@u-bourgogne.fr (H. Kheddouci), otogni@u-bourgogne.fr (O. Togni). 00-3X/$ - see front matter 00 Elsevier B.V. All rights reserved. doi:0.0/j.disc
2 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 The irregularity strength of regular graphs was considered by several authors. For a regular graph G of order n and degree r, let λ(g) = (n + r )/r. A simple counting argument gives s(g) λ(g). On the other hand, an upper bound of (n/) + 9 was given for regular graphs of order n in []. This result was improved recently in []. Nevertheless, there is still a great gap between lower and upper bounds on the irregularity strength of regular graphs. Moreover, for all the connected regular graphs for which the irregularity strength is known, we have s(g) λ(g) +. The following conjecture is due to Jacobson (see [8,]): Conjecture. There exists an absolute constant c such that for each regular graph G, s(g) λ(g) + c. Circulant graphs are a large family of regular graphs which are studied in the context of interconnection networks [] and have good properties such as symmetry and vertextransitivity. Definition. Let n be an integer and let s,s,...,s k be a sequence of integers, with s <s < <s k n/. The circulant graph G=C n (s,s,...,s k ) of order n is a graph with vertex set V (G) ={0,,...,n } and edge set E(G) ={(x, x ± s i mod n), x V (G), i k}. It is a Cayley graph on the additive group of integers modulo n, with set of generators {s,s,...,s k }. In this paper, we study the irregularity strength of circulant graphs of degree. We find the exact value for the irregularity strength of circulant graphs of the form C n (,k) with n k +. These graphs consists in a cycle of length n plus chords joining vertices at distance k on the cycle. We will use the following notations (see Fig. ): for any t, the vertices of C t+ (,k)are labeled y 0, y,...,y t going clockwise on the cycle and x 0 = y 0,x, x,...,x t going counterclockwise. Fig.. Notations.
3 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 3 For a weighting w on C t+ (,k), denote by a i (resp. b i ) the weight of the edge (x i,x i+ ) (resp. (y i,y i+ )) for 0 i t, and by a t = b t the weight of the edge (x t,y t ), and let c i = w(x i,x i+k ) 0 i t k, c i = w(y i,y i+k ) 0 i t k, c i = w(x i,y t i k+ ) t k + i t, c i = w(y i,x t i k+ ) t k + i t, c i = w(y i,x k i ) i k, c i = w(x i,y k i ) i k. Let us give a construction of C (t+)+ (,k)from C t+ (,k)useful for the proof of main results. Let G = C t+ (,k)and let P = (x t+,x,y,y t+ ) be a path of length 3 where t k. We define the graph G.P as follows: V(G.P ) = V (G) V(P ), ( k ) E(G.P ) = E(G) {(x t k+i,y t i+ )} {(x t,y t )} E(P ) i= k {(x t k++i,y t+3 i )} i= {(x t k+,x t+ ), (x t k+,x ), (y t k+,y t+ ), (y t k+,y )}. Observe that G.P = C t+ (,k). Thus for any t k, C t+ (,k) can be obtained by iterating (t k) times this composition starting from C k+ (,k).. Preliminaries Definition. For n = t +, with t k, C n (,k)verifies the property P t if it admits an irregular weighting of strength s = λ(c n (,k))= t + such that: (i) a t = b t = a t = b t + = s, (ii) c t i = c t i = s, for each i, 0 i k, (iii) a t i+ b t i+ k/ + i, for each i, 0 i k/, (iv) when k is even, a t k+i+ i +, for each i, 0 i k. Lemma. For k, C k+ (,k)verifies the property P k.
4 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 Proof. In order to prove that C k+ (,k)verifies the property P k, we construct an irregular weighting w as follows: a 0 = b 0 =, i + a i = + for each i, i k, b i = a i for each i, i k, c i = c i = i + for each i, 0 i k, c i = c i = k + for each i, k i k, c i = c i = for each i, k i. We can easily verify that we have d w (x 0 ) = d w (y 0 ) =, and for each i k: { dw (x i ) = a i + a i + c i + c i k = + i, d w (y i ) = b i + b i + c i + c i k = 3 + i. Consequently, w is irregular and of strength equal to λ(c k+ (,k))=k + (i.e., statements (i) and (ii) are verified). Moreover, by construction the remaining statements of property P k are also verified: the third statement is verified since a k i+ b k i+ = (k i + )/ + k/ i +. The fourth statement is also verified since a i+ = (i +)/ + = i + i +. See part A of Appendix for an example when k =. 3. Results In this section, we present two propositions. The first one construct an irregular weighting for C t+ (,k)for any t k. The second proposition allows to give an irregular weighting for the remaining graphs C n (,k), with n = t +, t + 3, t + for each t k. Proposition. For any t with t k, there exists an irregular weighting of C t+ (,k) which verifies the property P t. Proof. The proof is done by induction on t. Fort = k, the result holds by Lemma. Assume that there exists an irregular weighting of C t+ (,k), which verifies the property P t. We will construct a weighting of C t+ (,k)which verifies property P t+. Let w be an irregular weighting of G = C t+ (,k)which verifies the property P t. Let G = G.P = C t+ (,k)and w be the weighting of G constructed from the weighting w of G as follows: w(e) for e E(G)\M, w w(e) for e M, (e) = t + for e A B, t + for e C,
5 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 where k/ M = {(x t i+,x t i+ ), (y t i+,y t i+ )}, A = i= k {(x t k+i,y t i+3 )}, i= B ={(x,y ), (y t k+,y ), (x t k+,x ), (x t+,x )}, C ={(x t,x t+ ), (y t,y t+ ), (x t k+,x t+ ), (y t+,y ), (y t k+,y t+ )}. Note that, by statement (iii) of property P t of G, w(e) ife M. Thus, w (e) for each e E(G ). Moreover, the degrees of the vertices given by the weighting w are as follows: { dw (x i ) = d w (x i ) = i + for 0 i t k +, d w (y i ) = d w (y i ) = i + 3 for i t k +. Observe that for each of the following vertices, the weight of one adjacent edge has been decreased by one, and the weight of another adjacent edge has been increased by one. So the weighted degrees are unchanged: for 0 i k/, d w (x t i ) = (a t i ) + a t i + c t i k + (c t i + ) = d w (x t i ), d w (y t i ) = (b t i ) + b t i + c t i k + ( c t i + ) = d w (y t i ), d w (x t i ) = a t i + (a t i ) + c t i k + (c t i + ) = d w (x t i ), d w (y t i ) = b t i + (b t i ) + c t i k + ( c t i + ) = d w (y t i ). Moreover, when k is even, the weighted degrees of vertices x t k+ and y t k+ are not given above. Their weighted degrees are: { dw (x t k+ ) = a t k+ + a t k+ + c t k+ + c t k+ = d w (x t k+ ) +, d w (y t k+ ) = b t k+ + b t k+ + c t k+ + c t k+ = d w (y t k+ ) +. We can see that, in this case, d w (x t k+ ) = d w (y t k+3 ) and there does not exist a vertex u V(G ) such that d w (u) = d w (y t k+ ) (see part B of Appendix). For the vertices of P we have d w (x t+ ) = t +, d w (x ) = t + 8, d w (y t+ ) = t +, d w (y ) = t + 7.
6 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 Let a i,b i, c i and c i be the values of edges of G given by the weighting w as defined in Section. We distinguish two cases depending on the parity of k. Case : k is odd. In order to verify the property P t+ for G, one can see that w (e) t + for each e E(G ) and for each u, v V(G ), d w (u) = d w (v) when u = v. Thus w is irregular and the statements (i) and (ii) hold. The third one (iii) is also verified since k a (t+) i+ b (t+) i+ = t + + i for i = or and k a (t+) i+ b (t+) i+ b t (i )+ k k + i for each i, 3 i + (i ). Case : k is even (a complete example is given in Appendix). We use a cycle C induced by the following vertices C = (x t k+,x t k+,...,x t k+ ). In order for the weighting to be irregular, it suffices to decrease by two the weighted degree of x t k+ in w (i.e., to obtain d w (x t k+ ) = d w (y t k+ )) without changing degrees of other vertices. To do this, we decrease and increase alternately by one the weight of the edges of C starting from x t k+. As C is odd, the two edges of C which are adjacent to x t k+ are both decreased by one. Thus the degree of x t k+ is decreased by two. Moreover, for any other vertex of C, the degree is unchanged. As G verified statement (iv) of property P t, then the weights of edges of C which are decreased are greater or equal to one. In other hand, as the strength of G is equal to t + and edges of C are in G, so by increasing some edges of C by one, the strength of w remains t + = λ(g ). Observe that statements (i) (iii) of property P t+ are proved similarly than in case k odd. So we now prove statement (iv) for G. Note that a (t+) k+i+ = a t k+(i+)+ = a t k+(i+)+ i + for i k. Moreover, for i = k, a (t+) k+i+ = t + k + = k. The following proposition extends the irregular weighting to cases n = t +, t + 3 and t +, for t k. Proposition. If C t+ (,k)verifies property P t then there exists an irregular weighting of C t++i (,k), for any i, i 3, of strength s = λ(c t++i (,k))= t +. Proof. Observe that λ(c t++i (,k)) = (t + + i + 3)/ =t +. We start from G = C t+ (,k)with an irregular weighting verifying property P t and we add i vertices,
7 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 7 i 3, by subdividing the edge (x t,y t ) in i + edges (see Figs., where α, α, β and β are the weights of some edges of the irregular weighting of C t+ (,k)). The new edges and the edges whose endpoints have been modified are weighted as shown below: Case i = : a weighting is obtained simply by subdividing the edge (x t,y t ) in two and then by giving the weight t + to the two created edges (see Fig. ). Case i = : we distinguish between the case k odd and k even. The process for both cases is given in Fig. 3, where dashed edges have weight t + and bold edges are edges whose weights have been modified. Case i = 3: we distinguish between the case k odd and k even. The process for both cases is given in Fig.. From Propositions and, we deduce the following result: Theorem. For n k + and k, n + 3 s(c n (,k))=. Corollary. For n s k +, n + 3 s(c n (,s,s,...,s k )). Proof. Starting from an irregular weighting of C n (,s k ) given by Theorem, assign the weight to the other edges of C n (,s,s,...,s k ) and the weighting will remain irregular. Fig..An irregular weighting of Ct +(,k)on the right is obtained from the irregular weighting of Ct +(,k) on the left.
8 8 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 t t+ β β + t- t+3 t+7 t+7 t+ t+ t+ α α + t+- t+3 t+ t+ k is odd k is even Fig. 3. An irregular weighting of C t+3 (,k), with k odd (k = ) on the left and k even (k = ) on the right. α α + t t+- t+3 t+ t+ t+7 t+ t+ β t+ t+3 t t+ t+7 t+ t+ t+ k is odd k is even Fig.. An irregular weighting of C t+ (,k), with k odd (k = ) on the left and k even (k = ) on the right.. Concluding remarks We studied the irregularity strength of circulant graphs C n (,k)when k (n )/ and found the exact value. Our method does not seem to work for (n/) k (n/), because we have not found an irregular weighting to start the induction process. But, the isomorphisms of circulant graphs allow us to come back to some cases when k (n/). For instance, the following isomorphisms are easy to see: C k (,k) C k (, ), C 3k (,k) C 3k (, 3), C k (,k) C k (, ). More generally, if gcd(n, k) = then we have C n (,k) C n (,k mod n). Moreover, our study is also generalized to some circulant graphs C n (s,s ) with s = and s >s.ifgcd(n, s ) = orgcd(n, s ) = then C n (s,s ) C n (,k)for some k.
9 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 9 Appendix: a complete example when k = Let us give a complete example of the construction of an irregular weighting of C (, ) from C 7 (, ). The values on the edges represent their weights and the bold values on vertices represent their weighted degrees. Part A: an irregular weighting of C 7 (, ) verifying property P. Part B: the first step of the extension of the weighting of C 7 (, ) to the graph C (, ) by composition with P. Notice that the weighting is not irregular as there is two vertices of degree 7. Part C: the weighting of part B is modified to become irregular by using a cycle of length (in bold on the figure) to decrease the weighted degree of one of the two vertices of degree 7 to (A) (B) (C) 3-
10 0 J.-L. Baril et al. / Discrete Mathematics 30 (00) 0 References [] D. Amar, O. Togni, Irregularity strength of trees, Discrete Math. 90 ( 3) (998) 38. [] J.C. Bermond, F. Comellas, D.F. Hsu, Distributed loop computer-networks: a survey, J. Parallel Distributed Computing (99) 0. [3] G. Chartrand, M. Jacobson, J. Lehel, O. Oellerman, S. Ruiz, F. Saba, Irregular networks, Congr. Numer. (988) [] R.J. Faudree, J. Lehel, Bound on the irregularity strength of regular graphs, Colloq. Math. Soc. János Bolya (987) 7. [] A.M. Frieze, R. Gould, M. Karonski, F. Pfender, On graph irregularity strength, J. Graph Theory () (00) [] S. Jendroľ, M. Tkáč, The irregularity strength of tk p, Discrete Math. (99) [7] S. Jendroľ, V. Žoldák, The irregularity strength of generalized Petersen graphs, Math. Slovaca (99) [8] J. Lehel, Facts and quests on degree irregular assignments, Graph Theory, Combin. Appl. (99) [9] T. Nierhoff, A tight bound on the irregularity strength of graphs, SIAM J. Discrete Math. 3 (3) (000)
Neighbor-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 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 informationColourings of cubic graphs inducing isomorphic monochromatic subgraphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs arxiv:1705.06928v1 [math.co] 19 May 2017 Marién Abreu 1, Jan Goedgebeur 2, Domenico Labbate 1, Giuseppe Mazzuoccolo 3 1 Dipartimento
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 3811 380 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Disjoint hamiltonian cycles in bipartite graphs Michael
More informationColourings of cubic graphs inducing isomorphic monochromatic subgraphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs arxiv:1705.06928v2 [math.co] 10 Sep 2018 Marién Abreu 1, Jan Goedgebeur 2, Domenico Labbate 1, Giuseppe Mazzuoccolo 3 1 Dipartimento
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 informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
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 informationOn S-packing edge-colorings of cubic graphs
On S-packing edge-colorings of cubic graphs arxiv:1711.10906v1 [cs.dm] 29 Nov 2017 Nicolas Gastineau 1,2 and Olivier Togni 1 1 LE2I FRE2005, CNRS, Arts et Métiers, Université Bourgogne Franche-Comté, F-21000
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 informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
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 informationCycle Spectra of Hamiltonian Graphs
Cycle Spectra of Hamiltonian Graphs Kevin G. Milans, Dieter Rautenbach, Friedrich Regen, and Douglas B. West July, 0 Abstract We prove that every graph consisting of a spanning cycle plus p chords has
More informationCompletely Independent Spanning Trees in Some Regular Graphs
Completely Independent Spanning Trees in Some Regular Graphs Benoit Darties, Nicolas Gastineau, Olivier Togni To cite this version: Benoit Darties, Nicolas Gastineau, Olivier Togni. Completely Independent
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 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 informationAdvanced Combinatorial Optimization September 22, Lecture 4
8.48 Advanced Combinatorial Optimization September 22, 2009 Lecturer: Michel X. Goemans Lecture 4 Scribe: Yufei Zhao In this lecture, we discuss some results on edge coloring and also introduce the notion
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 informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationAdvanced Combinatorial Optimization September 24, Lecture 5
18.438 Advanced Combinatorial Optimization September 24, 2009 Lecturer: Michel X. Goemans Lecture 5 Scribe: Yehua Wei In this lecture, we establish the connection between nowhere-zero (nwz) k-flow and
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 informationStrong oriented chromatic number of planar graphs without short cycles
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 10:1, 008, 1 4 Strong oriented chromatic number of planar graphs without short cycles Mickaël Montassier 1, Pascal Ochem, and Alexandre
More informationArc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree S. Bessy and F. Havet, Projet Mascotte, CNRS/INRIA/UNSA, INRIA Sophia-Antipolis, 2004 route des Lucioles
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 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 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 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 informationPacking chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph Boštjan Brešar a,b Douglas F. Rall d Sandi Klavžar a,b,c Kirsti Wash e a Faculty of Natural Sciences and Mathematics,
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 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 informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationPancyclicity in claw-free graphs
Discrete Mathematics 56 (00) 151 160 www.elsevier.com/locate/disc Pancyclicity in claw-free graphs R.J. Gould, F. Pfender Department of Mathematics and Computer Science, Emory University, Atlanta, GA 303,
More informationPrime Factorization and Domination in the Hierarchical Product of Graphs
Prime Factorization and Domination in the Hierarchical Product of Graphs S. E. Anderson 1, Y. Guo 2, A. Rubin 2 and K. Wash 2 1 Department of Mathematics, University of St. Thomas, St. Paul, MN 55105 2
More informationMultiple Petersen subdivisions in permutation graphs
Multiple Petersen subdivisions in permutation graphs arxiv:1204.1989v1 [math.co] 9 Apr 2012 Tomáš Kaiser 1 Jean-Sébastien Sereni 2 Zelealem Yilma 3 Abstract A permutation graph is a cubic graph admitting
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 informationGraphs & Algorithms: Advanced Topics Nowhere-Zero Flows
Graphs & Algorithms: Advanced Topics Nowhere-Zero Flows Uli Wagner ETH Zürich Flows Definition Let G = (V, E) be a multigraph (allow loops and parallel edges). An (integer-valued) flow on G (also called
More informationAn efficient upper bound of the rotation distance of binary trees
Information Processing Letters 73 (2000) 87 92 An efficient upper bound of the rotation distance of binary trees Jean Pallo 1 LE2I, Université de Bourgogne, B.P. 47870, F21078 Dijon-Cedex, France Received
More informationDISTANCE LABELINGS: A GENERALIZATION OF LANGFORD SEQUENCES. 1. Introduction
DISTANCE LABELINGS: A GENERALIZATION OF LANGFORD SEQUENCES S. C. LÓPEZ AND F. A. MUNTANER-BATLE Abstract. A Langford sequence of order m and defect d can be identified with a labeling of the vertices of
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 informationGraphic sequences, adjacency matrix
Chapter 2 Graphic sequences, adjacency matrix Definition 2.1. A sequence of integers (d 1,..., d n ) is called graphic if it is the degree sequence of a graph. Example 2.2. 1. (1, 2, 2, 3) is graphic:
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 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 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 informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationPancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs
Pancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs Michael Ferrara 1 Silke Gehrke 2 Ronald Gould 2 Colton Magnant 3 Jeffrey Powell 4 November 7, 2012 Abstract A graph G is pancyclic if
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationAn upper bound on the domination number of n-vertex connected cubic graphs
Discrete Mathematics 309 (2009) 1142 1162 www.elsevier.com/locate/disc An upper bound on the domination number of n-vertex connected cubic graphs A.V. Kostochka a,b,, B.Y. Stodolsky a a Department of Mathematics,
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 informationMalaya J. Mat. 2(3)(2014)
Malaya J Mat (3)(04) 80-87 On k-step Hamiltonian Bipartite and Tripartite Graphs Gee-Choon Lau a,, Sin-Min Lee b, Karl Schaffer c and Siu-Ming Tong d a Faculty of Comp & Mathematical Sciences, Universiti
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 informationNowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.
Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:
More informationDistance labelings: a generalization of Langford sequences
Also available at http://amc-journal.eu ISSN -9 (printed edn.), ISSN -9 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Distance labelings: a generalization of Langford sequences S. C. López Departament
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 informationSome operations preserving the existence of kernels
Discrete Mathematics 205 (1999) 211 216 www.elsevier.com/locate/disc Note Some operations preserving the existence of kernels Mostafa Blidia a, Pierre Duchet b, Henry Jacob c,frederic Maray d;, Henry Meyniel
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 informationCRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES. Ahmed Bouchou and Mostafa Blidia
Opuscula Math. 36, no. 5 (2016, 563 574 http://dx.doi.org/10.7494/opmath.2016.36.5.563 Opuscula Mathematica CRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES Ahmed Bouchou and Mostafa Blidia
More informationAveraging 2-Rainbow Domination and Roman Domination
Averaging 2-Rainbow Domination and Roman Domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.0899v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationarxiv: v2 [cs.dm] 29 Mar 2013
arxiv:1302.6346v2 [cs.dm] 29 Mar 2013 Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard Laboratoire I3S, CNRS & Université de Nice-Sophia Antipolis, France.
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
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 informationarxiv: v1 [cs.dm] 25 Jun 2016
A permutation code preserving a double Eulerian bistatistic Jean-Luc Baril and Vincent Vajnovszki LEI, Université de Bourgogne Franche-Comté BP, Dijon Cedex, France {barjl}{vvajnov}@u-bourgogne.fr arxiv:.v
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationCycle Double Cover Conjecture
Cycle Double Cover Conjecture Paul Clarke St. Paul's College Raheny January 5 th 2014 Abstract In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture
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 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 informationTree-chromatic number
Tree-chromatic number Paul Seymour 1 Princeton University, Princeton, NJ 08544 November 2, 2014; revised June 25, 2015 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-1265563. Abstract Let
More informationOn a kind of restricted edge connectivity of graphs
Discrete Applied Mathematics 117 (2002) 183 193 On a kind of restricted edge connectivity of graphs Jixiang Meng a; ;1, Youhu Ji b a Department of Mathematics, Xinjiang University, Urumqi 830046, Xinjiang,
More informationOn the ascending subgraph decomposition problem for bipartite graphs
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 46 (2014) 19 26 www.elsevier.com/locate/endm On the ascending subgraph decomposition problem for bipartite graphs J. M.
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 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 informationA well-quasi-order for tournaments
A well-quasi-order for tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 June 12, 2009; revised April 19, 2011 1 Supported
More informationA Note on S-Packing Colorings of Lattices
A Note on S-Packing Colorings of Lattices Wayne Goddard and Honghai Xu Department of Mathematical Sciences Clemson University, Clemson SC 964 {goddard,honghax}@clemson.edu Abstract Let a, a,..., a k be
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 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 informationAcyclic and k-distance coloring of the grid
Information Processing Letters 87 (2003) 51 58 www.elsevier.com/locate/ipl Acyclic and k-distance coloring of the grid Guillaume Fertin a,, Emmanuel Godard b, André Raspaud b a IRIN UPRES-EA 2157, Université
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 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 informationDoyen-Wilson results for odd length cycle systems
Doyen-Wilson results for odd length cycle systems arxiv:1411.3785v [math.co] 1 Jun 015 Daniel Horsley and Rosalind A. Hoyte School of Mathematical Sciences Monash University Vic 3800, Australia danhorsley@gmail.com,
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
More information16 February 2010 Draft Version
Local Tournaments with the minimum number of Hamiltonian cycles or cycles of length three Dirk Meierling Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany e-mail: meierling@math2.rwth-aachen.de
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 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 informationSet-orderedness as a generalization of k-orderedness and cyclability
Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo 101-8430, Japan e-mail: ozeki@nii.ac.jp Kiyoshi Yoshimoto Department
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationAdvanced Combinatorial Optimization Updated February 18, Lecture 5. Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009)
18.438 Advanced Combinatorial Optimization Updated February 18, 2012. Lecture 5 Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009) In this lecture, we establish the connection between nowhere-zero k-flows
More informationThe Packing Coloring of Distance Graphs D(k, t)
The Packing Coloring of Distance Graphs D(k, t) arxiv:13020721v1 [mathco] 4 Feb 2013 Jan Ekstein Přemysl Holub Olivier Togni October 3, 2017 Abstract The packing chromatic number χ ρ (G) of a graph G is
More informationMaximising the number of induced cycles in a graph
Maximising the number of induced cycles in a graph Natasha Morrison Alex Scott April 12, 2017 Abstract We determine the maximum number of induced cycles that can be contained in a graph on n n 0 vertices,
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
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 informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
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 informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
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 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationON DOMINATION IN CUBIC GRAPHS
R u t c o r Research R e p o r t ON DOMINATION IN CUBIC GRAPHS Alexander K. Kelmans a RRR 28-2006, NOVEMBER, 2006 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew Road Piscataway,
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 informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More information