Non-cyclic graph of a group

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We associate a graph $\Gamma_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 \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 $\Gamma_G$ is finite if and only if $\Gamma_G$ has no infinite clique. We prove that if $G$ is a finite nilpotent group and $H$ is a group with $\Gamma_G\cong\Gamma_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 $\Gamma_G\cong \Gamma_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 $\Gamma_G \cong \Gamma_H$ for some group $H$, then $|G|=|H|$. These suggest the question whether the latter property holds for all finite non-cyclic groups.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Non-cyclic graph of a group does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-cyclic graph of a group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-cyclic graph of a group will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-5773

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.