Related papers: Graph equivariant cohomological rigidity for GKM g…
We introduce a class of labeled graphs (with legs) which contains two classes of GKM graphs of $4n$-dimensional manifolds with $T^{n}\times S^{1}$-actions, i.e., GKM graphs of the toric hyperK${\rm\ddot{a}}$hler manifolds and of the…
It follows from the GKM description of equivariant cohomology that the GKM graph of a GKM manifold has free equivariant graph cohomology, and satisfies a Poincar\'e duality condition. We prove that these conditions are sufficient for an…
Given a GKM$_3$ action of a torus $K$ on a manifold $M$ with GKM graph $\Gamma$, we show that for any extension of $\Gamma$ to an abstract GKM graph the corresponding restriction map in equivariant graph cohomology is surjective. While the…
This paper aims to determine the ring structure of the torus equivariant cohomology of odd-dimensional complex quadrics by computing the graph equivariant cohomology of their corresponding GKM graphs. We show that its graph equivariant…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
The equivariant cohomology ring of a GKM manifold is isomorphic to the cohomology ring of its GKM graph. In this paper we explore the implications of this fact for equivariant fiber bundles for which the total space and the base space are…
Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental…
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…
We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…
We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…
We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.
Suppose a compact torus $T$ acts on a closed smooth manifold $M$. Under certain conditions, Guillemin and Zara associate to $(M, T)$ a labeled graph $\mG_M$ where the labels lie in $H^2(BT)$. They also define the subring $H_T^*(\mG_M)$ of…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…
We prove that if two path algebras with homogeneous relations are isomorphic as algebras, then they are isomorphic as graded path algebras. This extends a result by Bell and Zhang in the connected case.
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.