English
Related papers

Related papers: On non-cyclic graph of finite groups

200 papers

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

Group Theory · Mathematics 2013-06-10 Mariagrazia Bianchi , Rachel D. Camina , Marcel Herzog , Emanuele Pacifici

For a finite non cyclic group $G$, let $\gamma(G)$ be the smallest integer $k$ such that $G$ contains $k$ proper subgroups $H_1,\dots,H_k$ with the property that every element of $G$ is contained in $H_i^g$ for some $i \in \{1,\dots,k\}$…

Group Theory · Mathematics 2013-10-08 Andrea Lucchini , Martino Garonzi

Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…

Representation Theory · Mathematics 2021-10-28 Dean Alvis

The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in…

Group Theory · Mathematics 2024-06-04 Surbhi , Geetha Venkataraman

This article considers the class of connected 3-colored digraphs. Let $G$ be a 3-colored digraph and $A(G)$ be its adjacency matrix. $G$ is said to be non-singular (resp. singular) if $A(G)$ is a non-singular (resp. singular) matrix. A…

Combinatorics · Mathematics 2026-05-12 Md Isheteyak Zaffer

A graph $G$ is called an $L_1$-graph if $d(u)+d(v)\ge|N(u)\cup N(v)\cup N(w)|-1$ for every triple of vertices $u,v,w$ where $u$ and $v$ are at distance 2 and $w\in N(u)\cap N(v)$. Asratian et al. (1996) proved that all finite connected…

Combinatorics · Mathematics 2019-04-16 Jonas B. Granholm

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

Group Theory · Mathematics 2013-11-26 Ashish Kumar Das , Deiborlang Nongsiang

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Combinatorics · Mathematics 2019-11-14 Czesław Bagiński , Piotr Grzeszczuk

The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…

Group Theory · Mathematics 2025-04-22 Mingzhu Chen , Natalia V. Maslova , Marianna R. Zinov'eva

Let $F$ and $G$ be simple finite oriented graphs (without symmetric arcs). A graph $G$ is called $F$-irregular if any two distinct vertices in $G$ belong to a different number of subgraphs of $G$ isomorphic to $F$. In this paper, we…

Combinatorics · Mathematics 2026-05-22 Tatiana Dovzhenok , Ilya Lukashenko , Yahor Filiuta

A finitely presented, torsion free, abelian-by-cyclic group can always be written as an ascending HNN extension Gamma_M of Z^n, determined by an n x n integer matrix M with det(M) \ne 0. The group Gamma_M is polycyclic if and only if…

Group Theory · Mathematics 2007-05-23 Benson Farb , Lee Mosher

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

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…

Group Theory · Mathematics 2024-09-24 Khyati Sharma , A. Satyanarayana Reddy

Let $\Gamma(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

Group Theory · Mathematics 2017-05-26 Ali Reza Moghaddamfar

Let $\Gamma(\mathbb{Z}_n[i])$ be the zero divisor graph over the ring $\mathbb{Z}_n[i]$. In this article, we study pancyclic properties of $\Gamma(\mathbb{Z}_n[i])$ and $\overline{\Gamma(\mathbb{Z}_n[i])}$ for different $n$. Also, we prove…

Combinatorics · Mathematics 2018-06-22 Ravindra Kumar , Om Prakash

Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…

Rings and Algebras · Mathematics 2016-04-14 Jutirekha Dutta , Dhiren Kumar Basnet , Rajat Kanti Nath

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

Group Theory · Mathematics 2016-06-06 R. Rajkumar , P. Devi , Andrei Gagarin

We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…

Geometric Topology · Mathematics 2011-08-16 Erica Flapan , Harry Tamvakis

A finite group $G$ is a "non-DCI group" if there exist subsets $S_1$ and $S_2$ of $G$, such that the associated Cayley digraphs $C\overrightarrow{ay}(G;S_1)$ and $C\overrightarrow{ay}(G;S_2)$ are isomorphic, but no automorphism of $G$…

Combinatorics · Mathematics 2023-03-08 Dave Witte Morris , Joy Morris

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