24 research outputs found
An improvement in the two-packing bound related to Vizing\u27s conjecture
Vizing\u27s conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs. In this note we improve the recent bound of Breŝar by applying a technique of Zerbib to show that for any graphs G and H, γ(G x H)≥ γ (G) 2/3(γ(H)-ρ(H)+1), where γ is the domination number, ρ is the 2-packing number, and x is the Cartesian product
Extremal Colorings and Independent Sets
We consider several extremal problems of maximizing the number of colorings and independent sets in some graph families with fixed chromatic number and order. First, we address the problem of maximizing the number of colorings in the family of connected graphs with chromatic number k and order n where k≥4 role= presentation style= box-sizing: inherit; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative; \u3ek≥4k≥4. It was conjectured that extremal graphs are those which have clique number k and size (k2)+n−k role= presentation style= box-sizing: inherit; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative; \u3e(k2)+n−k(k2)+n−k. We affirm this conjecture for 4-chromatic claw-free graphs and for all k-chromatic line graphs with k≥4 role= presentation style= box-sizing: inherit; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative; \u3ek≥4k≥4. We also reduce this extremal problem to a finite family of graphs when restricted to claw-free graphs. Secondly, we determine the maximum number of independent sets of each size in the family of n-vertex k-chromatic graphs (respectively connected n-vertex k-chromatic graphs and n-vertex k-chromatic graphs with c components). We show that the unique extremal graph is Kk∪En−k role= presentation style= box-sizing: inherit; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative; \u3eKk∪En−kKk∪En−k, K1∨(Kk−1∪En−k) role= presentation style= box-sizing: inherit; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative; \u3eK1∨(Kk−1∪En−k)K1∨(Kk−1∪En−k) and (K1∨(Kk−1∪En−k−c+1))∪Ec−1 role= presentation style= box-sizing: inherit; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative; \u3e(K1∨(Kk−1∪En−k−c+1))∪Ec−1(K1∨(Kk−1∪En−k−c+1))∪Ec−1 respectively
Vertex colouring and forbidden subgraphs - a survey
There is a great variety of colouring concepts and results in the literature. Here our focus is to survey results on vertex colourings of graphs defined in terms of forbidden induced subgraph conditions
Parameters related to fractional domination in graphs.
Thesis (M.Sc.)-University of Natal, 1995.The use of characteristic functions to represent well-known sets in graph theory such as dominating, irredundant, independent, covering and packing sets - leads naturally to fractional versions of these sets and corresponding fractional parameters. Let S be a dominating set of a graph G and f : V(G)~{0,1} the characteristic function of that set. By first translating the restrictions which define a dominating set from a set-based to a function-based form, and then allowing the function f to map the vertex set to the unit closed interval, we obtain the fractional generalisation of the dominating set S. In chapter 1, known domination-related parameters and their fractional generalisations are introduced, relations between them are investigated, and Gallai type results are derived. Particular attention is given to graphs with symmetry and to products of graphs. If instead of replacing the function f : V(G)~{0,1} with a function which maps the vertex set to the unit closed interval we introduce a function f' which maps the vertex set to {0, 1, ... ,k} (where k is some fixed, non-negative integer) and a corresponding change in the restrictions on the dominating set, we obtain a k-dominating function. In chapter 2 corresponding k-parameters are considered and are related to the classical and fractional parameters. The calculations of some well known fractional parameters are expressed as optimization problems involving the k- parameters. An e = 1 function is a function f : V(G)~[0,1] which obeys the restrictions that (i) every non-isolated vertex u is adjacent to some vertex v such that f(u)+f(v) = 1, and every isolated vertex w has f(w) = 1. In chapter 3 a theory of e = 1 functions and parameters is developed. Relationships are traced between e = 1 parameters and those previously introduced, some Gallai type results are derived for the e = 1
parameters, and e = 1 parameters are determined for several classes of graphs. The e = 1 theory is applied to derive new results about classical and fractional domination parameters
Recommended from our members
The chromatic index of simple graphs
The object of this thesis is twofold:
(i) to study the structural properties of graphs which are critical with respect to edge-colourings;
(ii) to apply the results obtained to the classification problem arising from Vizing's Theorem.
Chapter 1 contains a historical, non-technical introduction, general graph-theoretic definitions and notation, a discussion of Vizing's Theorem as well as a survey of the main results obtained to date in Vizing's classification problem. Chapter 2 introduces the notion of criticality in the first section; the second section contains both well-known and new constructions of critical graphs which will be used in later chapters. The third and final section contains new results concerning elementary properties of critical graphs. Chapter 3 deals with uniquely-colourable graphs and their relationship to critical graphs. Chapter 4 contains results on the connectivity of critical graphs, whereas Chapter 5 deals with bounds on the number of edges of these graphs. In particular, bounds improving those given by Vizing are presented. These results are applied to problems concerning planar graphs. In Chapter 6, critical graphs of small order are discussed. All such graphs of order at most 8 are determined, while the 'critical graph conjecture’ of Beineke & Wilson and Jakobsen is shown to be true for all graphs on at most 10 vertices. The seventh and final chapter deals with circuit length properties of critical graphs. In particular, the minimal order of certain critical graphs with given girth and maximum valency is determined. Results improving Vizing’s estimate of the circumference of critical graphs are also given. The Appendix includes a computer programme which generates critical graphs from simpler ones using a constructive algorithm given in Chapter 2
APPLICATING CVD ALGORITHM ON EDGE-COLORING OF SPECIAL GRAPHS
Heuristics algorithm is a soultion method that typically relatively quick to find a feasibel soloution with reasonable time and quality though there are no guarantees about if the quality of the solution is bad. This research explores the application of Conflicting Vertex Displacement (CVD) algorithm on edge-coloring of special graphs. This algorithm found by Fiol and Vilaltella [2] 6in 2012 and uses the idea of recolor of two “conflicts” edges (edges that are incident to a vertex) along the paths of adjacent vertices. The research tests the algorithm on special graphs, ie. bipartite graphs
Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem
The edge coloring problem asks for an assignment of colors to edges of a graph such that no two incident edges share the same color and the number of colors is minimized. It is known that all graphs with maximum degree Δ can be colored with Δ or Δ + 1 colors, but it is NP-hard to determine whether Δ colors are sufficient.
We present the first runtime analysis of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such as RLS and (1+1) EA efficiently find (2Δ - 1)-colorings on arbitrary graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary trees. A partial analysis for toroids also suggests efficient runtimes in bipartite graphs with many cycles. Experiments support these findings and investigate additional graph classes such as hypercubes, complete graphs and complete bipartite graphs. Theoretical and experimental results suggest that simple EAs find optimal colorings for all these graph classes in expected time O(Δℓ2m log m), where m is the number of edges and ℓ is the length of the longest simple path in the graph