English
Related papers

Related papers: Automorphism groups of Cayley graphs generated by …

200 papers

In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if a $3$-edge-connected graph…

Combinatorics · Mathematics 2024-07-19 István Estélyi , Ján Karabáš , Alexander Mednykh , Roman Nedela

Given a finite simple graph $\Gamma$ on $n$ vertices its complementary prism is the graph $\Gamma\bar{\Gamma}$ that is obtained from $\Gamma$ and its complement $\bar{\Gamma}$ by adding a perfect matching, where each its edge connects two…

Combinatorics · Mathematics 2021-10-22 Marko Orel

Let $\overline G$ be the wonderful compactification of a simple affine algebraic group $G$ of adjoint type defined over $\mathbb C.$ Let ${\overline T}\subset \overline G$ be the closure of a maximal torus $T\subset G.$ We prove that the…

Algebraic Geometry · Mathematics 2017-02-28 Indranil Biswas , Subramaniam Senthamarai Kannan , Donihakalu Shankar Nagaraj

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…

Combinatorics · Mathematics 2017-07-11 Yi Wang , Yan-Quan Feng

Let $G$ be a (finite or infinite) group, and let $K_G = \mathrm{Cay} ( G;G \smallsetminus \{1\} )$ be the complete graph with vertex set $G$, considered as a Cayley graph of $G$. Being a Cayley graph, it has a natural edge-colouring by sets…

Combinatorics · Mathematics 2024-04-16 Shirin Alimirzaei , Dave Witte Morris

The structure of a certain subgroup $S$ of the automorphism group of a partially commutative group (RAAG) $G$ is described in detail: namely the subgroup generated by inversions and elementary transvections. We define admissible subsets of…

Group Theory · Mathematics 2017-06-30 Andrew J. Duncan , Vladimir N. Remeslennikov

We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$. This is…

Combinatorics · Mathematics 2020-11-25 Itai Benjamini , David Ellis

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

Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large graphs of similar structure may be represented by a graphon.…

Combinatorics · Mathematics 2024-06-26 Mahya Ghandehari , Jeannette Janssen , Nauzer Kalyaniwalla

Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group generated by all transpositions. It is known that all eigenvalues of $T_n$ are integers. However, an explicit description of the spectrum is unknown. In this…

Combinatorics · Mathematics 2022-09-27 Elena V. Konstantinova , Artem Kravchuk

We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…

Differential Geometry · Mathematics 2019-08-14 Debraj Chakrabarti , Meera Mainkar , Savannah Swiatlowski

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…

Combinatorics · Mathematics 2017-02-21 Bo Ling , Ben Gong Lou

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

Combinatorics · Mathematics 2025-08-19 Mengyu Cao , Mei Lu , Zequn Lv , Xiamiao Zhao

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

Discrete Mathematics · Computer Science 2015-06-17 Pavel Klavík , Peter Zeman

In this paper we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $a^\iota=a^{-1}$, for every…

Combinatorics · Mathematics 2020-01-16 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Combinatorics · Mathematics 2019-12-03 Simon Schmidt , Chase Vogeli , Moritz Weber

The class of generalized Petersen graphs was introduced by Coxeter in the 1950s. Frucht, Graver and Watkins determined the automorphism groups of generalized Petersen graphs in 1971, and much later, Nedela and \v{S}koviera and…

Combinatorics · Mathematics 2012-07-12 Marston D. E. Conder , Tomaž Pisanski , Arjana Žitnik

Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the…

Combinatorics · Mathematics 2026-04-27 Grigorii Antiufeev

A Cayley graph on the symmetric group $S_n$ is said to have the Aldous property if its strictly second largest eigenvalue (that is, the largest eigenvalue strictly smaller than the degree) is attained by the standard representation of…

Combinatorics · Mathematics 2025-10-29 Yuxuan Li , Binzhou Xia , Sanming Zhou

A graph \Gamma is said to be {\em symmetric} if its automorphism group \Aut(\Gamma) is transitive on the arc set of \Gamma. Let $G$ be a finite non-abelian simple group and let \Gamma be a connected pentavalent symmetric graph such that…

Group Theory · Mathematics 2017-03-20 Jia-Li Du , Yan-Quan Feng , Jin-Xin Zhou
‹ Prev 1 4 5 6 7 8 10 Next ›