RECURSIVE FORMULA FOR CALCULATING THE CHROMATIC POLYNOMIAL OF A GRAPH BY VERTEX DELETION 1


 Avis Shaw
 2 years ago
 Views:
Transcription
1 2004,24B(4): RECURSIVE FORMULA FOR CALCULATING THE CHROMATIC POLYNOMIAL OF A GRAPH BY VERTEX DELETION 1 Xu Jin ( ) Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan , China. Abstract A new recursive vertexdeleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials. Key words Graph Theory, chromatic polynomial, vertexdeleting recursive formula 2000 MR Subject Classification 05C 1 Introduction All graphs considered in this paper are assumed to be finite and loopless. They may, however, have multiple edges. Let P(G, λ) denote the chromatic polynomial of a graph G. The vertexset and edgeset of graph G are denoted by V (G) and E(G) respectively. A subset V of the vertexset V (G) is said to be contracted if all vertices in V are identified to a simple vertex and those edges incident with V are incident with this new vertex. Let V V (G). We use G[V ] to denote the subgraph of G induced by V. Other notations are the same as in [1]. The graph coloring problem has been widely applied in many areas such as Information Theory, Cryptography, and Computer Science etc. One of the main topics in the study of graph coloring is chromatic polynomials. Of course, calculating the chromatic polynomial of a graph is a basic and important problem. There are many results on chromatic polynomial of a graph and the calculation of chromatic polynomials of some special graphs [25]. The following is a list of the well known results. 1.1 If G has p vertices but no edges, i.e., G is a null graph with p vertices, then P(G, λ) = λ p. (1) 1.2 If G is a complete graph with p vertices, where p > 0, then P(G, λ) = λ(λ 1)(λ 2) (λ p + 1). (2) 1 Received April 19, This research is partially supported by NNSF of China.
2 578 ACTA MATHEMATICA SCIENTIA Vol.24 Ser.B 1.3 If G has two edges with the same pair of ends then the deletion of one of them does not affect the value of P(G, λ). 1.4 Let G be the union of two subgraphs H and K whose intersection is a complete graph. Then P(G, λ)p(h K, λ) = P(H, λ)p(k, λ). (3) 1.5 Let T p be a tree with p vertices. Then P(T p, λ) = λ(λ 1) p 1. (4) 1.6 Let C p denote a circuit of p vertices, where p 2. Then and for p > 2 we have P(C 2, λ) = λ(λ 1), (5) P(C p, λ) = (λ 1) p + ( 1) p (λ 1). (6) 1.7 Let W p, where p 2, be a wheel of p spokes. This means that W p is obtained from a circuit C p of p vertices by adjoining a new vertex v, called the hub, and then joining v to the p vertices of C p by p new edges called spokes. Then P(W p, λ) = λ{(λ 2) p + ( 1) p (λ 2)}. (7) 1.8 Let G be a disconnected graph with m (m 2) components G 1, G 2,, G m. Then P(G, λ) = P(G 1, λ)p(g 2, λ) P(G m, λ). (8) There are three known methods of calculating chromatic polynomials of arbitrary graphs. These are given as follows. 1.9 The recursion formula by adding (or deleting) an edge Suppose u, v V (G), and e = uv E(G) in the graph G. Then P(G, λ) = P(G + e, λ) + P(G e, λ), (9) where G+e is the graph obtained from G by adding the edge e and G e is the graph obtained from G by contracting the vertices u and v of e The Whithey formula Let G be a simple graph. Then the coefficient of λ i in P(G, λ) is equal to q r=0 ( 1)r N(i, r), where N(i, r)denotes the number of spanning subgraph with r edges and i components, q = E(G) [3] The analytical formula Let G be an arbitrary graph with p vertices. Then p P(G, λ) = b r [λ] r, (10) where b r is the number of distinct colorpartitions of V (G) into r colorclasses and r=1 [λ] r = λ(λ 1)(λ 2) (λ r + 1). (11) In this paper, a new algorithm for calculating the chromatic polynomials of graphs, called the recursive vertexdeleting formula, is presented. It will be shown that this new algorithm is more efficient than the fomulae (9), (10) and (11) in both theoretical analyses and prctical computaion of chromatic polynomials.
3 No.4 Xu: RECURSIVE FORMULA FOR CALCULATING CHROMATIC POLYNOMIAL Recursive Formula by Deleting a Vertex Let G be a graph and H V (G). Let G H denote the graph obtained from G by deleting H together with all edges incident to it. For convenience, we replace G {u} by G u ; G {u,v} by G uv ; G {u,v,w} by G uvw, etc. for vertices u, v, w V (G). Lemma 1 Let G be a simple graph with p vertices. Suppose u V (G) and d(u) = p 1. Then P(G, λ) = λ P(G u, λ 1). (12) Lemma 2 Let G be a simple graph with p vertices. Suppose u, v V (G) uv E(G), and d(u) = p 2. Then P(G, λ) = λ {P(G u, λ 1) + P(G uv, λ 1)}. (13) The proof of Lemma 1 is omitted here. A proof of Lemma 2 can be obtained from (9) and (12). Now, we state the main result of this paper. Theorem 3 Let G be a simple graph with p vertices. Let u V (G) be such that d(u) = p k (1 k p 1). Let Vu = {v 1, v 2,, v k 1 } V (G) be the set of all the vertices in V (G) such that uv 1, uv 2,, uv k 1 / E(G). Then we have the following recursive vertexdeleting formula for the computation of the chromatic polynomial of the graph G: P(G, λ) = λ P(G u, λ 1) + λ P(G {u} H, λ 1), (14) H V u where the summation is extended over all independent sets H V u with 1 H k 1. Here G J denotes the graph obtained from G by deleting all the vertices in J G. Proof We prove the formula by mathematical induction on k. The cases k = 1, 2 are true by Lemmas 1 and 2. Suppose the result is true for all k n ( p 1), where k 2. Now, we consider the case k = n + 1. Suppose d(u) = p n 1 and V u = {v 1, v 2,, v n } V (G). It follows easily from the edge addition formula (9) that P(G, λ) = P(G + uv n+1, λ) + P(G uv n+1, λ). (15) For the graph G + uv n+1, by the induction hypothesis, we have P(G + uv n+1, λ) = λ {P(G u, λ 1) + where the set V 1 is the independent set V 1 = {v 1, v 2,,v n } and the summation is extended over all independent sets in V 1, that is, H 1 V 1 = {v 1, v 2,, v n }, 1 H 1 n. H 1 V 1 P(G {u} H1, λ 1)}, (16) In the graph G uv n+1, the vertices u and v n+1 are contracted to u. Let V 2 denote the subset of vertices which are not adjacent to u in G uv n+1. Clearly, V 2 {v 1, v 2,, v n } = V 1, and we have P(G uv n+1, λ) = λ {P(G uvn+1, λ 1) + H 2 V 2 P(G {u,vn+1} H 2, λ 1)}, (17)
4 580 ACTA MATHEMATICA SCIENTIA Vol.24 Ser.B where the summation is extended over all independent sets H 2 V 2 with 1 H 2 V 2. Substituting (16) and (17) in (15), we have P(G, λ) = λ P(G u, λ 1) + λ H V P(G {u} H, λ 1), where V = {v 1, v 2,, v n+1 } and the summation is extended over all independent sets H V with 1 H k. Therefore, (14) is true for k = n + 1. By Theorem 3, we can easily obtain the following special cases. Corollary 4 Let G be a simple graph with p vertices. Let u, v 1, v 2,, v k 1 V (G) be such that d(u) = p k (1 k p 1), uv 1, uv 2,, uv k 1 E(G) and G[v 1, v 2,,v k 1 ] is a complete graph. Then k 1 P(G, λ) = λ {P(G u, λ 1) + P(G uvi, λ 1)}. (18) Corollary 5 Let G be a simple graph with p vertices. Let u, v 1, v 2,, v k 1 V (G) and G[v 1, v 2,,v k 1 ] is a null graph (that is, there are no edges in such graph). Then i=1 k 1 P(G, λ) = λ {P(G u, λ 1) + P(G uvi, λ 1)} + 1 i j k 1 i=1 P(G uviv j, λ 1) P(G {u,v1,v 2,,v k 1 }, λ 1)}. 1 i j l k 1 P(G uviv jv l, λ 1) (19) By applying the above recursive formula, we can compute the chromatic polynomial a graph G in the following five steps. In the next section, we give an example to show the computing process. Step 1. Find a vertex u in G such that its degree d(u) = (G). Step 2. Find the subset V u = {v; v V (G), uv / E(G)}. Step 3. Calculate the subgraph G u and the subgraphs G {u} H, where H is an independent of V u. Step 4. Calculate P(G u, λ 1) and all P(G {u} H, λ 1). Step 5. Calculate P(G, λ) using P(G u, λ 1) and all P(G {u} H, λ 1) in (14). 3 Example Example 1 We now use our formula to calculate the chromatic polynomial of the graph G shown in Figure 1 (a). The computation is completed in 5 steps. Step 1. Clearly, vertex u is the maximum degree vertex in the graph G. Step 2. It is easily to obtain that the subset V u = {v, w, x}. Step 3. We only need to calculate the subgraph G u, the subgraphs G uv, G uw, G ux, G uvw and G uvx showing in the graphs (b), (c), (d), (e), (f) and (g) shown in Figure 1, respectively.
5 No.4 Xu: RECURSIVE FORMULA FOR CALCULATING CHROMATIC POLYNOMIAL 581 Figure 1 The subgraphs involved in the recursive formula in Example Step 4. By the formulas (1.2), (1.3) and (1.6) in Section 1, we have directly P(G u, t) = t(t 1)(t 2)[(t 1)4 + (t 1)][(t 1) 5 (t 1)] t 2 (t 1) 2 = t(t 1)(t 2) 2 (t 2 3t + 3)(t 2 2t + 2), (20) P(G uv, t) = t(t 1)(t 2) [(t 1)4 + (t 1)] t(t 1) 2 t t(t 1) = t(t 1) 3 (t 2)(t 2 3t + 3), (21) P(G ux, t) = P(G uw, t) = t(t 1)2 [(t 1) 5 (t 1)] t = t(t 1) 3 (t 2)(t 2 2t + 2), (22) P(G uvx, t) = P(G uvw, t) = t(t 1) 5, where for simplicity the shorthand t = λ 1 is used. Step 5. Finally, by substituting (20), (21), (22), and (23) in (14), we finally obtain the
6 582 ACTA MATHEMATICA SCIENTIA Vol.24 Ser.B chromatic polynomial P(G, λ): P(G, λ) = λ P(G u, λ 1) + λ {P(G uv, λ 1) + P(G ux, λ 1) +P(G uw, λ 1) + P(G uvx, λ 1) + P(G uvw, λ 1)} = λ {t(t 1)(t 2) 2 (t 2 3t + 3)(t 2 2t + 2) +t(t 1) 3 (t 2)(t 2 3t + 3) + 2t(t 1) 3 (t 2)(t 2 2t + 2) + 2t(t 1) 5 } (24) = λ(λ 1)(λ 2){(λ 3) 2 (λ 2 5λ + 7)(λ 2 4λ + 6) +(λ 2) 2 (λ 3)(λ 2 5λ + 7) + 2(λ 2) 2 (λ 3)(λ 2 4λ + 6) + 2(λ 2) 4 } = λ(λ 1)(λ 2)(λ 6 12λ λ 4 122λ λ 2 378λ + 182). References 1 Bondy J A, Murty U S R. Graph Theory with Applications. New York: American Elsevier, MacMillan, Biggs N L. Algebraic Graph Theory. London, New York: Cambridge University Press, U K, Whiteny H. A Logical Expansion in Mathematics. Bull Amer Math Soc, 1932, 38: Xu Jin, Liu Z H. The chromatic polynomial between graph and its complementabout Akiyama and Harary s open problem. Graphs and Combinatorics, 1995, 11(4): Xu Jin. The triangles in a selfcomplementary graph. Acta Mathematica Scientia, 1996, 16(supp): 3841
Total colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, JianLiang Wu, SiFeng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationAn inequality for the group chromatic number of a graph
Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph HongJian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,
More informationA 2factor in which each cycle has long length in clawfree graphs
A factor in which each cycle has long length in clawfree graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationOdd induced subgraphs in graphs of maximum degree three
Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A longstanding
More informationThe treenumber and determinant expansions (Biggs 67)
The treenumber and determinant expansions (Biggs 67) André Schumacher March 20, 2006 Overview Biggs 67 [1] The treenumber κ(γ) κ(γ) and the Laplacian matrix The σ function Elementary (sub)graphs Coefficients
More informationTenacity and rupture degree of permutation graphs of complete bipartite graphs
Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China
More informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph HongJian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
More informationMean RamseyTurán numbers
Mean RamseyTurán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρmean coloring of a graph is a coloring of the edges such that the average
More informationOn the kpath cover problem for cacti
On the kpath cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison GomoryHu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationComputer Science Department. Technion  IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
 1  THREE TREEPATHS Avram Zehavi Alon Itai Computer Science Department Technion  IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationSingle machine parallel batch scheduling with unbounded capacity
Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University
More informationTools for parsimonious edgecolouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR201010
Tools for parsimonious edgecolouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR201010 Tools for parsimonious edgecolouring of graphs
More informationGeneralized Induced Factor Problems
Egerváry Research Group on Combinatorial Optimization Technical reports TR200207. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationNonSeparable Detachments of Graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR200112. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONEPOINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationON THE COEFFICIENTS OF THE LINKING POLYNOMIAL
ADSS, Volume 3, Number 3, 2013, Pages 4556 2013 Aditi International ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL KOKO KALAMBAY KAYIBI Abstract Let i j T( M; = tijx y be the Tutte polynomial of the matroid
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationGraph Classification and Easy Reliability Polynomials
Mathematical Assoc. of America American Mathematical Monthly 121:1 November 18, 2014 1:11 a.m. AMM.tex page 1 Graph Classification and Easy Reliability Polynomials Pablo Romero and Gerardo Rubino Abstract.
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationInduction Problems. Tom Davis November 7, 2005
Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More information3. Eulerian and Hamiltonian Graphs
3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from
More informationCycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationCrossing the Bridge at Night
A1:01 Crossing the Bridge at Night Günter Rote Freie Universität Berlin, Institut für Informatik Takustraße 9, D14195 Berlin, Germany rote@inf.fuberlin.de A1:02 August 21, 2002 A1:03 A1:04 Abstract We
More informationarxiv:math/0606467v2 [math.co] 5 Jul 2006
A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group arxiv:math/0606467v [math.co] 5 Jul 006 Richard P. Stanley Department of Mathematics, Massachusetts
More informationOn the independence number of graphs with maximum degree 3
On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287292 ISSN 03406253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationHigh degree graphs contain largestar factors
High degree graphs contain largestar factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationLecture Notes on GRAPH THEORY Tero Harju
Lecture Notes on GRAPH THEORY Tero Harju Department of Mathematics University of Turku FIN20014 Turku, Finland email: harju@utu.fi 1994 2011 Contents 1 Introduction..........................................................
More informationClique coloring B 1 EPG graphs
Clique coloring B 1 EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCENUBA, Buenos Aires, Argentina. b Departamento de Matemática, FCEUNLP, La
More informationSpecial Classes of Divisor Cordial Graphs
International Mathematical Forum, Vol. 7,, no. 35, 737749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur  66 3, Tamil Nadu, India varatharajansrnm@gmail.com
More informationA Study of Sufficient Conditions for Hamiltonian Cycles
DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph
More informationUPPER BOUNDS ON THE L(2, 1)LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationCacti with minimum, secondminimum, and thirdminimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 4758 (2010) Cacti with minimum, secondminimum, and thirdminimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationSmall Maximal Independent Sets and Faster Exact Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected
More informationAnswer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )
1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the
More informationGraph theoretic techniques in the analysis of uniquely localizable sensor networks
Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of
More informationarxiv: v2 [math.co] 30 Nov 2015
PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationOutline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1
GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept
More informationApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and HingFung Ting 2 1 College of Mathematics and Computer Science, Hebei University,
More informationBOUNDARY EDGE DOMINATION IN GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 04874, ISSN (o) 04955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 19704 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationLecture 7: NPComplete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NPComplete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
More informationCombinatorial 5/6approximation of Max Cut in graphs of maximum degree 3
Combinatorial 5/6approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université ParisDauphine, Place du Marechal de Lattre de Tassigny, F75775 Paris
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More informationONLINE VERTEX COLORINGS OF RANDOM GRAPHS WITHOUT MONOCHROMATIC SUBGRAPHS
ONLINE VERTEX COLORINGS OF RANDOM GRAPHS WITHOUT MONOCHROMATIC SUBGRAPHS MARTIN MARCINISZYN AND RETO SPÖHEL Abstract. Consider the following generalized notion of graph colorings: a vertex coloring of
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationOn the maximum average degree and the incidence chromatic number of a graph
Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2
More informationZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS
ZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationMinimum degree condition forcing complete graph immersion
Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139
More informationON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER
Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationAN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC
AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l4] on graphs and matroids I used definitions equivalent to the following.
More informationMinimum Bisection is NPhard on Unit Disk Graphs
Minimum Bisection is NPhard on Unit Disk Graphs Josep Díaz 1 and George B. Mertzios 2 1 Departament de Llenguatges i Sistemes Informátics, Universitat Politécnica de Catalunya, Spain. 2 School of Engineering
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE COFACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II MohammediaCasablanca,
More informationMaxMin Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297302. MaxMin Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationDegreeassociated reconstruction parameters of complete multipartite graphs and their complements
Degreeassociated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertexdeleted subgraphofagraphgisacard.
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationWhen is a graph planar?
When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationDetermination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
More informationTypes of Degrees in Bipolar Fuzzy Graphs
pplied Mathematical Sciences, Vol. 7, 2013, no. 98, 48574866 HIKRI Ltd, www.mhikari.com http://dx.doi.org/10.12988/ams.2013.37389 Types of Degrees in Bipolar Fuzzy Graphs Basheer hamed Mohideen Department
More informationDefinition 11.1. Given a graph G on n vertices, we define the following quantities:
Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationFIXED POINT SETS OF FIBERPRESERVING MAPS
FIXED POINT SETS OF FIBERPRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 email: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. FiniteDimensional
More informationRamsey numbers for bipartite graphs with small bandwidth
Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationVector Spaces II: Finite Dimensional Linear Algebra 1
John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition
More informationFoundations of Logic and Mathematics
Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic
More informationGraph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS  Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More information