653 research outputs found

    Automated Discharging Arguments for Density Problems in Grids

    Full text link
    Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of 37≈0.428571\frac{3}{7} \approx 0.428571 and a lower bound of 512≈0.416666\frac{5}{12}\approx 0.416666. We present a new, experimental framework for producing discharging arguments using an algorithm. This algorithm replaces the lengthy case analysis of human-written discharging arguments with a linear program that produces the best possible lower bound using the specified set of discharging rules. We use this framework to present a lower bound of 2355≈0.418181\frac{23}{55} \approx 0.418181 on the density of an identifying code in the hexagonal grid, and also find several sharp lower bounds for variations on identifying codes in the hexagonal, square, and triangular grids.Comment: This is an extended abstract, with 10 pages, 2 appendices, 5 tables, and 2 figure

    Revisiting path-type covering and partitioning problems

    Get PDF
    This is a survey article which is at the initial stage. The author will appreciate to receive your comments and contributions to improve the quality of the article. The author's contact address is [email protected] problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering problem), covering the vertex set by independent sets (coloring problem), and covering the vertex set by paths or cycles. A similar concept which is partitioning problem is also equally important. Lately research in graph theory has produced unprecedented growth because of its various application in engineering and science. The covering and partitioning problem by paths itself have produced a sizable volume of literatures. The research on these problems is expanding in multiple directions and the volume of research papers is exploding. It is the time to simplify and unify the literature on different types of the covering and partitioning problems. The problems considered in this article are path cover problem, induced path cover problem, isometric path cover problem, path partition problem, induced path partition problem and isometric path partition problem. The objective of this article is to summarize the recent developments on these problems, classify their literatures and correlate the inter-relationship among the related concepts

    The zero forcing polynomial of a graph

    Full text link
    Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored. A zero forcing set is a set of initially colored vertices which causes the entire graph to eventually become colored. In this paper, we study the counting problem associated with zero forcing. We introduce the zero forcing polynomial of a graph GG of order nn as the polynomial Z(G;x)=∑i=1nz(G;i)xi\mathcal{Z}(G;x)=\sum_{i=1}^n z(G;i) x^i, where z(G;i)z(G;i) is the number of zero forcing sets of GG of size ii. We characterize the extremal coefficients of Z(G;x)\mathcal{Z}(G;x), derive closed form expressions for the zero forcing polynomials of several families of graphs, and explore various structural properties of Z(G;x)\mathcal{Z}(G;x), including multiplicativity, unimodality, and uniqueness.Comment: 23 page

    THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References

    Get PDF
    and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a

    Connected factors in graphs - a survey

    Get PDF

    On the algorithmic complexity of twelve covering and independence parameters of graphs

    Get PDF
    The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs

    Super-simple (v,5,2)(v,5,2) directed designs and their smallest defining sets with its application in LDPC codes

    Full text link
    In this paper, we show that for all v≡0,1v\equiv 0,1 (mod 5) and v≥15v\geq 15, there exists a super-simple (v,5,2)(v,5,2) directed design, also for these parameters there exists a super-simple (v,5,2)(v,5,2) directed design such that its smallest defining sets contain at least half of its blocks. Also, we show that these designs are useful in constructing parity-check matrices of LDPC codes.Comment: arXiv admin note: substantial text overlap with arXiv:1508.0009
    • …
    corecore