English
Related papers

Related papers: Marked Groups with Isomorphic Cayley Graphs but Di…

200 papers

Differential operators of Schrodinger type are considered on metric Cayley graphs of free groups with a minimal set of M generators. The potential and edge lengths may vary with the M edge types. Using novel methods, a set of M multipliers…

Mathematical Physics · Physics 2015-06-30 Robert Carlson

Let $X$ be a Polish space with Borel probability measure $\mu,$ and let $G$ be a Borel graph on $X$ with no odd cycles and maximum degree $\Delta(G).$ We show that the Baire measurable edge chromatic number of $G$ is at most $\Delta(G)+1$,…

Logic · Mathematics 2021-12-21 Matt Bowen , Felix Weilacher

The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and only if xy is not in E. A bipartite graph is chordal…

Discrete Mathematics · Computer Science 2013-09-24 Anne Berry , Andreas Brandstädt , Konrad Engel

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

Combinatorics · Mathematics 2026-03-25 Piotr Grzeszczuk

Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

Group Theory · Mathematics 2016-10-18 J. Awang , M. Pfeiffer , N. Ruskuc

A measure-scaling quasi-isometry between two connected graphs is a quasi-isometry that is quasi-$\kappa$-to-one in a natural sense for some $\kappa>0$. For non-amenable graphs, all quasi-isometries are quasi-$\kappa$-to-one for any…

Group Theory · Mathematics 2021-05-12 Anthony Genevois , Romain Tessera

The classical Cayley map, X --> (I_n-X)/(I_n+X), is a birational isomorphism between the special orthogonal group SO_n and its Lie algebra so_n, which is SO_n-equivariant with respect to the conjugating and adjoint actions respectively. We…

Algebraic Geometry · Mathematics 2007-05-23 Nicole Lemire , Vladimir L. Popov , Zinovy Reichstein

We show that there are $k$ simple graphs whose Kronecker covers are isomorphic to the bipartite Kneser graph $H(n,k)$, and that their chromatic numbers coincide with $\chi(K(n,k)) = n - 2k + 2$. We also determine the automorphism groups of…

Combinatorics · Mathematics 2020-12-08 Takahiro Matsushita

We present a new correspondence between acyclic orientations and coloring of a signed graph (symmetric graph). Goodall et al. introduced a bivariate chromatic polynomial $\chi_G(k,l)$ that counts the number of signed colorings using colors…

Combinatorics · Mathematics 2022-09-07 Jiyang Gao

A connected Cayley graph on an abelian group with a finite generating set $S$ can be represented by its Heuberger matrix, i.e., an integer matrix whose columns generate the group of relations between members of $S$. In a previous article,…

Combinatorics · Mathematics 2025-09-23 Jonathan Cervantes , Mike Krebs

In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…

Data Structures and Algorithms · Computer Science 2016-06-02 Fahad Bin Mortuza

We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…

Combinatorics · Mathematics 2024-07-02 Gary R. W. Greaves , Jeven Syatriadi , Charissa I. Utomo

We show that for certain integers $n$, the problem of whether or not a Cayley digraph $\Gamma$ of $\mathbb Z_n$ is also isomorphic to a Cayley digraph of some other abelian group $G$ of order $n$ reduces to the question of whether or not a…

Combinatorics · Mathematics 2020-09-21 Edward Dobson , Joy Morris

Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by showing that the latter give distinct results when evaluated at…

Combinatorics · Mathematics 2019-04-10 Matthias Beck , Erika Meza , Bryan Nevarez , Alana Shine , Michael Young

We show that there are Cayley automatic groups that are not Cayley biautomatic. In addition, we show that there are Cayley automatic groups with undecidable Conjugacy Problem and that the Isomorphism Problem is undecidable in the clas of…

Group Theory · Mathematics 2011-08-16 Alexei Miasnikov , Zoran Sunic

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

Combinatorics · Mathematics 2019-09-17 Georg Grasegger , Jan Legerský , Josef Schicho

In 2015, Matthias Beck and his team developed a computer program in SAGE which efficiently determines the number of signed proper $k$-colorings for a given signed graph. In this article, we determine the number of different signatures on…

Combinatorics · Mathematics 2018-12-21 Deepak , Bikash Bhattacharjya

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

General Mathematics · Mathematics 2009-09-29 Linfan Mao , Yanpei Liu

We investigate when a Borel graph admits a (Borel or measurable) orientation with outdegree bounded by $k$ for various cardinals $k$. We show that for a p.m.p. graph $G$, a measurable orientation can be found when $k$ is larger than the…

Logic · Mathematics 2021-07-12 Riley Thornton

In this paper we characterize all of Cayley graphs on dihedral groups with metric dimension two.

Combinatorics · Mathematics 2017-01-31 Ali Behtoei , Yaser Golkhandypour