13 research outputs found

    The Group Structure of Pivot and Loop Complementation on Graphs and Set Systems

    Get PDF
    We study the interplay between principal pivot transform (pivot) and loop complementation for graphs. This is done by generalizing loop complementation (in addition to pivot) to set systems. We show that the operations together, when restricted to single vertices, form the permutation group S_3. This leads, e.g., to a normal form for sequences of pivots and loop complementation on graphs. The results have consequences for the operations of local complementation and edge complementation on simple graphs: an alternative proof of a classic result involving local and edge complementation is obtained, and the effect of sequences of local complementations on simple graphs is characterized.Comment: 21 pages, 7 figures, significant additions w.r.t. v3 are Thm 7 and Remark 2

    The Interlace Polynomial

    Full text link
    In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.Comment: 18 pages, 5 figures, to appear as a chapter in: Graph Polynomials, edited by M. Dehmer et al., CRC Press/Taylor & Francis Group, LL

    Nullity and Loop Complementation for Delta-Matroids

    Full text link
    We show that the symmetric difference distance measure for set systems, and more specifically for delta-matroids, corresponds to the notion of nullity for symmetric and skew-symmetric matrices. In particular, as graphs (i.e., symmetric matrices over GF(2)) may be seen as a special class of delta-matroids, this distance measure generalizes the notion of nullity in this case. We characterize delta-matroids in terms of equicardinality of minimal sets with respect to inclusion (in addition we obtain similar characterizations for matroids). In this way, we find that, e.g., the delta-matroids obtained after loop complementation and after pivot on a single element together with the original delta-matroid fulfill the property that two of them have equal "null space" while the third has a larger dimension.Comment: Changes w.r.t. v4: different style, Section 8 is extended, and in addition a few small changes are made in the rest of the paper. 15 pages, no figure

    On the linear algebra of local complementation

    Get PDF
    AbstractWe explore the connections between the linear algebra of symmetric matrices over GF(2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can also be generated by an operation defined using inverse matrices

    The adjacency matroid of a graph

    Full text link
    If GG is a looped graph, then its adjacency matrix represents a binary matroid MA(G)M_{A}(G) on V(G)V(G). MA(G)M_{A}(G) may be obtained from the delta-matroid represented by the adjacency matrix of GG, but MA(G)M_{A}(G) is less sensitive to the structure of GG. Jaeger proved that every binary matroid is MA(G)M_{A}(G) for some GG [Ann. Discrete Math. 17 (1983), 371-376]. The relationship between the matroidal structure of MA(G)M_{A}(G) and the graphical structure of GG has many interesting features. For instance, the matroid minors MA(G)−vM_{A}(G)-v and MA(G)/vM_{A}(G)/v are both of the form MA(G′−v)M_{A}(G^{\prime}-v) where G′G^{\prime} may be obtained from GG using local complementation. In addition, matroidal considerations lead to a principal vertex tripartition, distinct from the principal edge tripartition of Rosenstiehl and Read [Ann. Discrete Math. 3 (1978), 195-226]. Several of these results are given two very different proofs, the first involving linear algebra and the second involving set systems or delta-matroids. Also, the Tutte polynomials of the adjacency matroids of GG and its full subgraphs are closely connected to the interlace polynomial of Arratia, Bollob\'{a}s and Sorkin [Combinatorica 24 (2004), 567-584].Comment: v1: 19 pages, 1 figure. v2: 20 pages, 1 figure. v3:29 pages, no figures. v3 includes an account of the relationship between the adjacency matroid of a graph and the delta-matroid of a graph. v4: 30 pages, 1 figure. v5: 31 pages, 1 figure. v6: 38 pages, 3 figures. v6 includes a discussion of the duality between graphic matroids and adjacency matroids of looped circle graph
    corecore