Related papers: Graph equivariant cohomological rigidity for GKM g…

We identify the equivariant coinvariant ring of a pseudo-reflection group with its image under the localization map. We then show that this image can be realized as the equivariant cohomology of a sort linear hypergraph, analogous to a GKM…

For Hamiltonian circle actions on compact, connected, four-dimensional manifolds, we give a generators and relations description for the even part of the equivariant cohomology, as an algebra over the equivariant cohomology of a point. This…

In this paper, we define `simplicial GKM orbifold complexes' and study some of their topological properties. We introduce the concept of filtration of regular graphs and `simplicial graph complexes', which have close relations with…

Let $T$ be a torus of dimension $n>1$ and $M$ a compact $T-$manifold. $M$ is a GKM manifold if the set of zero dimensional orbits in the orbit space $M/T$ is zero dimensional and the set of one dimensional orbits in $M/T$ is one…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cospectrality implies singular cospectrality, but the converse…

We show that under standard assumptions on the isotropy groups of an integer GKM manifold, the equivariant Stiefel-Whitney classes of the action are determined by the GKM graph. This is achieved via a GKM-style description of the…

The purpose of this paper is to determine the ring structure of the graph equivariant cohomology of the GKM graph induced from the even-dimensional complex quadrics. We show that the graph equivariant cohomology is generated by two types of…

We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…

We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the…

Given a graph $\Gamma$, one may conside the set $X$ of its vertices as a metric space by assuming that all edges have length one. We consider two versions of homology theory of $\Gamma$ and their $K$-theory counterparts -- the $K$-theory of…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…

We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity.

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of…

We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.

We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving that it is a switching isomorphism invariant. When $G$ is a finite group, we prove that $G$-cospectrality is equivalent to cospectrality with…

In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.