1,024 research outputs found

    Packing 3-vertex paths in claw-free graphs and related topics

    Get PDF
    An L-factor of a graph G is a spanning subgraph of G whose every component is a 3-vertex path. Let v(G) be the number of vertices of G and d(G) the domination number of G. A claw is a graph with four vertices and three edges incident to the same vertex. A graph is claw-free if it has no induced subgraph isomorphic to a claw. Our results include the following. Let G be a 3-connected claw-free graph, x a vertex in G, e = xy an edge in G, and P a 3-vertex path in G. Then (a1) if v(G) = 0 mod 3, then G has an L-factor containing (avoiding) e, (a2) if v(G) = 1 mod 3, then G - x has an L-factor, (a3) if v(G) = 2 mod 3, then G - {x,y} has an L-factor, (a4) if v(G) = 0 mod 3 and G is either cubic or 4-connected, then G - P has an L-factor, (a5) if G is cubic with v(G) > 5 and E is a set of three edges in G, then G - E has an L-factor if and only if the subgraph induced by E in G is not a claw and not a triangle, (a6) if v(G) = 1 mod 3, then G - {v,e} has an L-factor for every vertex v and every edge e in G, (a7) if v(G) = 1 mod 3, then there exist a 4-vertex path N and a claw Y in G such that G - N and G - Y have L-factors, and (a8) d(G) < v(G)/3 +1 and if in addition G is not a cycle and v(G) = 1 mod 3, then d(G) < v(G)/3. We explore the relations between packing problems of a graph and its line graph to obtain some results on different types of packings. We also discuss relations between L-packing and domination problems as well as between induced L-packings and the Hadwiger conjecture. Keywords: claw-free graph, cubic graph, vertex disjoint packing, edge disjoint packing, 3-vertex factor, 3-vertex packing, path-factor, induced packing, graph domination, graph minor, the Hadwiger conjecture.Comment: 29 page

    Upper bounds on the k-forcing number of a graph

    Full text link
    Given a simple undirected graph GG and a positive integer kk, the kk-forcing number of GG, denoted Fk(G)F_k(G), is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete dynamical process described by the following rule. Starting from an initial set of colored vertices and stopping when all vertices are colored: if a colored vertex has at most kk non-colored neighbors, then each of its non-colored neighbors becomes colored. When k=1k=1, this is equivalent to the zero forcing number, usually denoted with Z(G)Z(G), a recently introduced invariant that gives an upper bound on the maximum nullity of a graph. In this paper, we give several upper bounds on the kk-forcing number. Notable among these, we show that if GG is a graph with order n2n \ge 2 and maximum degree Δk\Delta \ge k, then Fk(G)(Δk+1)nΔk+1+min{δ,k}F_k(G) \le \frac{(\Delta-k+1)n}{\Delta - k + 1 +\min{\{\delta,k\}}}. This simplifies to, for the zero forcing number case of k=1k=1, Z(G)=F1(G)ΔnΔ+1Z(G)=F_1(G) \le \frac{\Delta n}{\Delta+1}. Moreover, when Δ2\Delta \ge 2 and the graph is kk-connected, we prove that Fk(G)(Δ2)n+2Δ+k2F_k(G) \leq \frac{(\Delta-2)n+2}{\Delta+k-2}, which is an improvement when k2k\leq 2, and specializes to, for the zero forcing number case, Z(G)=F1(G)(Δ2)n+2Δ1Z(G)= F_1(G) \le \frac{(\Delta -2)n+2}{\Delta -1}. These results resolve a problem posed by Meyer about regular bipartite circulant graphs. Finally, we present a relationship between the kk-forcing number and the connected kk-domination number. As a corollary, we find that the sum of the zero forcing number and connected domination number is at most the order for connected graphs.Comment: 15 pages, 0 figure

    Packing 3-vertex paths in cubic 3-connected graphs

    Full text link
    Let v(G) and p(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem: Is the following claim (P) true ? (P) if G is a 3-connected and cubic graph, then p(G) = [v(G)/3], where [v(G)/3] is the floor of v(G)/3. We show, in particular, that claim (P) is equivalent to some seemingly stronger claims. It follows that if claim (P) is true, then Reed's dominating graph conjecture (see [14]) is true for cubic 3-connected graphs.Comment: 24 pages and 11 figure

    Minimum Degree and Disjoint Cycles in Claw-Free Graphs

    Get PDF
    https://digitalcommons.memphis.edu/speccoll-faudreerj/1219/thumbnail.jp

    Randomized word-parallel algorithms for detection of small induced subgraphs

    Get PDF
    Induced subgraph detection is a widely studied set of problems in theoretical computer science, with applications in e.g. social networks, molecular biology and other domains that use graph representations. Our focus lies on practical comparison of some well-known deterministic algorithms to recent Monte Carlo algorithms for detecting subgraphs on three and four vertices. For algorithms that involve operations with adjacency matrices, we study the gain of applying word parallelism, i.e. exploiting the parallel nature of common processor operations such as bitwise conjunction and disjunction. We present results of empirical running times for our implementations of the algorithms. Our results reveal insights as to when the Monte Carlo algorithms trump their deterministic counterparts and also include statistically significant improvements of several algorithms when applying word parallelism

    ALGEBRAIC AND COMBINATORIAL PROPERTIES OF CERTAIN TORIC IDEALS IN THEORY AND APPLICATIONS

    Get PDF
    This work focuses on commutative algebra, its combinatorial and computational aspects, and its interactions with statistics. The main objects of interest are projective varieties in Pn, algebraic properties of their coordinate rings, and the combinatorial invariants, such as Hilbert series and Gröbner fans, of their defining ideals. Specifically, the ideals in this work are all toric ideals, and they come in three flavors: they are defining ideals of a family of classical varieties called rational normal scrolls, cut ideals that can be associated to a graph, and phylogenetic ideals arising in a new and increasingly popular area of algebraic statistics
    corecore