Related papers: Second extra differential on odd graph complexes
We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs of $G$-cospectral gain graphs, that are gain graphs cospectral with respect to every representation of the gain group $G$. For instance,…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
We show that the zeroth cohomology of M. Kontsevich's graph complex is isomorphic to the Grothendieck-Teichmueller Lie algebra grt_1. The map is explicitly described. This result has applications to deformation quantization and Duflo…
We put a cochain complex structure ${CH}^*(\mathcal Z_K)$ on the cohomology of a moment-angle complex $\mathcal Z_K$ and call the resulting cohomology the double cohomology, ${HH}^*(\mathcal Z_K)$. We give three equivalent definitions for…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…
A hole in a graph G is an induced cycle of length at least four; an antihole is a hole in the complement of G. In 2005, Chudnovsky, Cornuejols, Liu, Seymour and Vuskovic showed that it is possible to test in polynomial time whether a graph…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
What are called secondary characteristic classes in Chern-Weil theory are a refinement of ordinary characteristic classes of principal bundles from cohomology to differential cohomology. We consider the problem of refining the construction…
Graph neural networks have achieved great success in learning node representations for graph tasks such as node classification and link prediction. Graph representation learning requires graph pooling to obtain graph representations from…
We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.
A proper vertex coloring $\varphi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\in V(G)$ there exists a color $c$ such that $\varphi^{-1}(c)\cap N(x)$ is odd-sized. The minimum number of colors in any odd coloring of…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, or into an odd and an even induced subgraph. We refer to a…
In this paper we will prove a super-analogue of a well-known result by Kontsevich which states that the homology of a certain complex which is generated by isomorphism classes of oriented graphs can be calculated as the Lie algebra homology…
We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy…
We give a description of cyclic cohomology and its pairing with K-groups for 2-cocycle deformation of algebras graded over discrete groups. The proof relies on a realization of monodromy for the Gauss-Manin connection on periodic cyclic…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
The classes of odd graphs $O_n$ and middle levels graphs $B_n$ form one parameter subclasses of the Kneser graphs and bipartite Kneser graphs respectively. In particular both classes are vertex transitive while resisting definitive…
Let $G$ be a finite simple graph with edge ideal $I(G)$. Let $J(G)$ denote the Alexander dual of $I(G)$. We show that a description of all induced cycles of odd length in $G$ is encoded in the associated primes of $J(G)^2$. This result…