The adjacency matroid of a graph

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_A(G)$ on $V(G)$. $M_A(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_A(G)$ is less sensitive to the structure of $G$. Jaeger proved that every binary matroid is $M_A(G)$ for some $G$ [Ann. Discrete Math. 17 (1983), 371-376]. The relationship between the matroidal structure of $M_A(G)$ and the graphical structure of $G$ has many interesting features. For instance, the matroid minors $M_A(G)-v$ and $M_A(G)\mathrm{/}v$ are both of the form $M_A(G^{\mathrm{\prime }}-v)$ where $G^{\mathrm{\prime }}$ may be obtained from $G$ 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 $G$ and its full subgraphs are closely connected to the interlace polynomial of Arratia, Bollob'{a}s and Sorkin [Combinatorica 24 (2004), 567-584].