English
Related papers

Related papers: Biggs tree groups

200 papers

The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the identity. For infinite graphs $D(G)$ is bounded by the…

Combinatorics · Mathematics 2018-10-05 Svenja Hüning , Wilfried Imrich , Judith Kloas , Hannah Schreiber , Thomas W. Tucker

Let $\Gamma$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn:Sabidussi:1997}), it is shown that the diameter of the…

Discrete Mathematics · Computer Science 2015-12-11 Ashwin Ganesan

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Combinatorics · Mathematics 2015-05-05 Alireza Abdollahi , Shahrooz Janbaz , Mojtaba Jazaeri

A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq…

Combinatorics · Mathematics 2025-12-23 Jing Yang , Lihua Feng , Rongrong Lu , Tingzeng Wu

A bi-Cayley graph over a cyclic group $\mathbb{Z}_n$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=R^{-1}\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T=T^{-1}\subseteq…

Combinatorics · Mathematics 2026-01-22 Jing Yang , Fangming Xian

A group $G$ is said to have the property $R_\infty$ if every automorphism $\phi \in {\rm Aut}(G)$ has an infinite number of $\phi$-twisted conjugacy classes. Recent work of Gon\c{c}alves and Kochloukova uses the $\Sigma^n$…

Group Theory · Mathematics 2011-05-11 Nic Koban , Peter Wong

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh

We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…

Combinatorics · Mathematics 2014-05-29 Anton Bankevich , Dmitri Karpov

Given a permutation group $G$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph with connection set the set of all derangements of $G$. We prove that, when $G$ is transitive of degree at least $3$, $\Gamma_G$ contains a triangle.…

Combinatorics · Mathematics 2020-09-03 Andriaherimanana Sarobidy Razafimahatratra , Karen Meagher , Pablo Spiga

We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main…

Combinatorics · Mathematics 2026-03-11 Iqbal Atmaja , Yeni Susanti , Ahmad Erfanian

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

Representation Theory · Mathematics 2018-11-30 Valdemar V. Tsanov

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Formal Languages and Automata Theory · Computer Science 2017-03-16 Lukas Fleischer , Manfred Kufleitner

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

Group Theory · Mathematics 2015-03-13 Azer Akhmedov

We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…

Combinatorics · Mathematics 2015-03-27 Ademir Hujdurović , Klavdija Kutnar , Dave Witte Morris , Joy Morris

We consider analogues of Grigorchuk-Gupta-Sidki (GGS-)groups acting on trees of growing degree; the so-called growing GGS-groups. These groups are not just infinite and do not possess the congruence subgroup property, but many of them are…

Group Theory · Mathematics 2024-06-03 Rachel Skipper , Anitha Thillaisundaram

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

Group Theory · Mathematics 2021-02-15 Daniele Garzoni

We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are…

Combinatorics · Mathematics 2018-03-23 Christoph Hofer-Temmel , Florian Lehner

For groups $G$ that can be generated by an involution and an element of odd prime order, this paper gives a sufficient condition for a certain Cayley graph of $G$ to be a graphical regular representation (GRR), that is, for the Cayley graph…

Group Theory · Mathematics 2024-08-28 Binzhou Xia

In this article, some necessary conditions of group vertex magicness of graphs with at least one pendant, group vertex magicness of product graphs, are proved. A characterization of group vertex magicness of trees of diameter up to 5. for…

Combinatorics · Mathematics 2023-02-22 Karthik S , M Sabeel K , K. Paramasivam

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash