Local complementation and interlacement graphs
نویسندگان
چکیده
منابع مشابه
Interlacement percolation on transient weighted graphs
In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [14], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and analyze some of its properties on specific classes of graphs. For the case of non-amenable graphs, we prove that the critical value u∗ for the percolation of the vacant set...
متن کاملOn graphs and codes preserved by edge local complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and errorcorrecting codes. We define a new graph class, ELC-preserved graphs, comprising all graphs that have an ELC orbit of size one. Through an exhaustive search, we find all ELC-preserved graphs o...
متن کاملOn the interlace polynomials
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the generating functions for other kinds of circuit partitions. The interlace polynomials of Arratia, Bollobás and Sorkin [J. Combin. Theory Ser. B 92 (2004) 199-233; C...
متن کاملHypomorphy of graphs up to complementation
Let V be a set of cardinality v (possibly infinite). Two graphsG and G with vertex set V are isomorphic up to complementation if G is isomorphic to G or to the complement G of G. Let k be a non-negative integer, G and G are k-hypomorphic up to complementation if for every k-element subsetK of V , the induced subgraphs G↾K and G′↾K are isomorphic up to complementation. A graph G is k-reconstruct...
متن کاملBinary Symmetric Matrix Inversion Through Local Complementation
We consider the Schur complement operation for symmetric matrices over GF(2), which we identify with graphs through the adjacency matrix representation. It is known that Schur complementation for such a matrix (i.e., for a graph) can be decomposed into a sequence of two types of elementary Schur complement operations: (1) local complementation on a looped vertex followed by deletion of that ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1981
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90255-7