English
Related papers

Related papers: The commuting graphs of certain cyclic-by-abelian …

200 papers

Let $G_n=\mathbb{Z}_n\times \mathbb{Z}_n$ for $n\geq 4$ and $S=\{(i,0),(0,i),(i,i): 1\leq i \leq n-1\}\subset G_n$. Define $\Gamma(n)$ to be the Cayley graph of $G_n$ with respect to the connecting set $S$. It is known that $\Gamma(n)$ is a…

Combinatorics · Mathematics 2026-03-17 Angsuman Das , S. Morteza Mirafzal

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

Group Theory · Mathematics 2021-02-01 Peter J. Cameron , Saul D. Freedman , Colva M. Roney-Dougal

Let $Z(\cal L)$ be the center of a Lie algebra $\cal L$ with Lie bracket $[\cdot, \cdot]$. %We then define The commuting graph of $\cal L$ is then defined by the simple undirected graph $\Gamma({\cal L})=(V_{\cal L},E_{\cal L})$ in which…

Rings and Algebras · Mathematics 2025-12-08 Hieu V. Ha , Vu A. Le , Tuan A. Nguyen , Tuyen T. M. Nguyen , Hoa D. Quang

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Group Theory · Mathematics 2017-06-19 Teng Fang , Xin Gui Fang , Binzhou Xia , Sanming Zhou

We describe the complete spectra of Laplacian, signless Laplacian, and adjacency matrices associated with the commuting graphs of a finite group using group theoretic information. We provide a method to find the center of a group by only…

General Mathematics · Mathematics 2023-05-09 Gargi Ghosh , Samiron Parui

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

Combinatorics · Mathematics 2023-04-20 Babak Miraftab , Dave Witte Morris

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

Combinatorics · Mathematics 2012-11-27 Francesco G. Russo

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the graph $\Gamma_G(N)$, which is the graph associated to the conjugacy classes of $G$ contained in $N$, has no triangles and when the graph…

Group Theory · Mathematics 2024-02-12 Antonio Beltrán , María José Felipe , Carmen Melchor

It has been shown that there is a Hamilton cycle in every connected Cayley graph on each group G whose commutator subgroup is cyclic of prime-power order. This paper considers connected, vertex-transitive graphs X of order at least 3 where…

Combinatorics · Mathematics 2016-09-07 Edward Dobson , Heather Gavlas , Joy Morris , Dave Witte

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

Group Theory · Mathematics 2024-04-22 Nanying Yang , Ilya Gorshkov

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

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

Combinatorics · Mathematics 2026-05-06 Julia Baligacs , Sofia Brenner , Annette Lutz , Lena Volk

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Group Theory · Mathematics 2025-08-11 Peice Hua

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

Group Theory · Mathematics 2021-03-10 David G. Costanzo , Mark L. Lewis , Stefano Schmidt , Eyob Tsegaye , Gabe Udell

A finite group is called $\psi$-divisible iff $\psi(H)|\psi(G)$ for any subgroup $H$ of a finite group $G$. Here, $\psi(G)$ is the sum of element orders of $G$. For now, the only known examples of such groups are the cyclic ones of…

Group Theory · Mathematics 2022-03-02 Mihai-Silviu Lazorec

Morgan and Parker have proved that if $G$ is a group satisfying the condition that $Z(G) = 1$, then the connected components of the commuting graph of $G$ have diameter at most $10$. Parker has proved that if in addition $G$ is solvable,…

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

Combinatorics · Mathematics 2017-03-08 Luke Morgan , Joy Morris , Gabriel Verret

We study the commuting graph of $n\times n$ matrices over the field of $p$-adics $\mathbb{Q}_p$, whose vertices are non-scalar $n\times n$ matrices with entries in $\mathbb{Q}_p$ and whose edges connect pairs of matrices that commute under…

Rings and Algebras · Mathematics 2024-07-22 Ralph Morrison

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Group Theory · Mathematics 2020-06-23 Cristina Acciarri , Andrea Lucchini

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

Group Theory · Mathematics 2024-04-24 Marco Fusari , Andrea Previtali , Pablo Spiga
‹ Prev 1 4 5 6 7 8 10 Next ›