English
Related papers

Related papers: Graph equivariant cohomological rigidity for GKM g…

200 papers

We prove that ample groupoids with sigma-compact unit spaces are equivalent if and only if they are stably isomorphic in an appropriate sense, and relate this to Matui's notion of Kakutani equivalence. We use this result to show that…

Operator Algebras · Mathematics 2017-05-10 Toke Meier Carlsen , Efren Ruiz , Aidan Sims

Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…

Combinatorics · Mathematics 2020-01-28 Omid Etesami , Willem H. Haemers

In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…

Machine Learning · Computer Science 2020-07-03 Hoang NT , Takanori Maehara

An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…

Optimization and Control · Mathematics 2016-11-03 Reza Takapoui , Stephen Boyd

We prove a formula for the ${\mathbb S}_n$-equivariant Euler characteristic of the moduli space of graphs $\mathcal{MG}_{g,n}$. Moreover, we prove that the rational ${\mathbb S}_n$-invariant cohomology of $\mathcal{MG}_{g,n}$ stabilizes for…

Algebraic Topology · Mathematics 2025-11-05 Michael Borinsky , Jos Vermaseren

For any graph G we define bigraded cohomology groups whose graded Euler characteristic is a multiple of the Yamada polynomial of G.

Geometric Topology · Mathematics 2012-02-20 V. Vershinin , A. Vesnin

The deck of a graph $X$, $D(X)$, is defined as the multiset of all vertex-deleted subgraphs of $X$. Two graphs are said to be hypomorphic, if they have the same deck. Kelly-Ulam conjecture states that any two hypomorphic graphs on at least…

General Mathematics · Mathematics 2018-01-01 Adel Tadayyonfar , Ali Reza Ashrafi

It is well-known [KST93] that the complexity of the Graph Automorphism problem is characterized by a special case of Graph Isomorphism, where the input graphs satisfy the "promise" of being rigid (that is, having no nontrivial…

Computational Complexity · Computer Science 2018-04-03 Eric Allender , Joshua A. Grochow , Dieter van Melkebeek , Cristopher Moore , Andrew Morgan

In this paper, we introduce the GKM theoretical counterpart of the equivariant complex vector bundles as the "leg bundle". We also provide a definition for the projectivization of a leg bundle and prove the Borel-Hirzebruch type formula for…

Algebraic Topology · Mathematics 2025-06-09 Shintaro Kuroki , Grigory Solomadin

Let $\Gamma$ be a finite d-valent graph and G an n-dimensional torus. An ``action'' of G on $\Gamma$ is defined by a map, $\alpha$, which assigns to each oriented edge e of $\Gamma$ a one-dimensional representation of G (or, alternatively,…

Combinatorics · Mathematics 2007-05-23 Victor Guillemin , Catalin Zara

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…

Combinatorics · Mathematics 2024-08-27 Rui Xue

We first show the existence of a weight filtration on the equivariant cohomology of real algebraic varieties equipped with the action of a finite group, by applying group cohomology to the dual geometric filtration. We then prove the…

Algebraic Geometry · Mathematics 2017-08-18 Fabien Priziac

We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…

Operator Algebras · Mathematics 2018-10-11 Soumalya Joardar , Arnab Mandal

A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…

Discrete Mathematics · Computer Science 2021-12-21 Joseph Berleant , Kristin Sheridan , Anne Condon , Virginia Vassilevska Williams , Mark Bathe

We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…

Operator Algebras · Mathematics 2025-06-25 Rasmus Bentmann , Ralf Meyer

Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…

Discrete Mathematics · Computer Science 2021-02-25 Jin-Yi Cai , Artem Govorov

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective…

Combinatorics · Mathematics 2012-10-18 Jan Hubicka , Jürgen Jost , Yangjing Long , Peter F. Stadler , Ling Yang

The aim of this paper is to describe the torus equivariant $K$-ring of even-dimensional complex quadrics by studying the graph equivariant $K$-theory of their corresponding GKM graphs. This involves providing a presentation for its graph…

Algebraic Topology · Mathematics 2025-11-06 Bidhan Paul

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

Computational Complexity · Computer Science 2011-10-10 Jin-Yi Cai , Xi Chen , Pinyan Lu
‹ Prev 1 4 5 6 7 8 10 Next ›