Non-cyclic graph of a group
| dc.creator | Abdollahi, Alireza | |
| dc.creator | Hassanabadi, A. Mohammadi | |
| dc.date | 2007-08-17 | |
| dc.date.accessioned | 2026-07-07T08:24:05Z | |
| dc.date.available | 2026-07-07T08:24:05Z | |
| dc.description | We associate a graph $Γ_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of $Γ_G$ is finite if and only if $Γ_G$ has no infinite clique. We prove that if $G$ is a finite nilpotent group and $H$ is a group with $Γ_G\congΓ_H$ and $|Cyc(G)|=|Cyc(H)|=1$, then $H$ is a finite nilpotent group. We give some examples of groups $G$ whose non-cyclic graphs are ``unique'', i.e., if $Γ_G\cong Γ_H$ for some group $H$, then $G\cong H$. In view of these examples, we conjecture that every finite non-abelian simple group has a unique non-cyclic graph. Also we give some examples of finite non-cyclic groups $G$ with the property that if $Γ_G \cong Γ_H$ for some group $H$, then $|G|=|H|$. These suggest the question whether the latter property holds for all finite non-cyclic groups. | |
| dc.identifier | https://arxiv.org/abs/0708.2327 | |
| dc.identifier | http://arxiv.org/abs/0708.2327 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/136223 | |
| dc.subject | Group Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 20D60; 05C25 | |
| dc.title | Non-cyclic graph of a group | |
| dc.type | text |