Conditions on the Edges and Vertices of Non-commuting Graph

2015 ◽  
Vol 74 (1) ◽  
Author(s):  
M. Jahandideh ◽  
M. R. Darafsheh ◽  
N. H. Sarmin ◽  
S. M. S. Omer
Keyword(s):  
Finite Group ◽  
Conjugacy Classes ◽  
Commuting Graph ◽  
Vertex Set ◽  
A Finite Group

Abstract - Let G􀡳 be a non- abelian finite group. The non-commuting graph ,􀪡is defined as a graph with a vertex set􀡳 − G-Z(G)􀢆in which two vertices x􀢞 and y􀢟 are joined if and only if xy􀢞􀢟 ≠ yx􀢟􀢞.  In this paper, we invest some results on the number of edges set , the degree of avertex of non-commuting graph and the number of conjugacy classes of a finite group. In order that if 􀪡􀡳non-commuting graph of H ≅ non - commuting graph of G􀪡􀡴,H 􀡴 is afinite group, then |G􀡳| = |H􀡴| .

The metric dimension & distance spectrum of non-commuting graph of dihedral group

2021 ◽  
pp. 2150082
Author(s):  
Subarsha Banerjee
Keyword(s):  
Finite Group ◽  
Dihedral Group ◽  
Metric Dimension ◽  
Distance Spectrum ◽  
Commuting Graph ◽  
Vertex Set ◽  
A Finite Group

The non-commuting graph [Formula: see text] of a finite group [Formula: see text] has vertex set as [Formula: see text] and any two vertices [Formula: see text] are adjacent if [Formula: see text]. In this paper, we have determined the metric dimension and resolving polynomial of [Formula: see text], where [Formula: see text] is the dihedral group of order [Formula: see text]. The distance spectrum of [Formula: see text] has also been determined for all [Formula: see text].

scholarly journals On Thompson’s Conjecture for Alternating GroupsAp+3

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Shitian Liu ◽  
Yong Yang
Keyword(s):  
Finite Group ◽  
Prime Graph ◽  
Conjugacy Classes ◽  
Connected Components ◽  
Prime Divisors ◽  
Vertex Set ◽  
Thompson’S Conjecture ◽  
Trivial Center ◽  
A Finite Group

LetGbe a group. Denote byπ(G)the set of prime divisors of|G|. LetGK(G)be the graph with vertex setπ(G)such that two primespandqinπ(G)are joined by an edge ifGhas an element of orderp·q. We sets(G)to denote the number of connected components of the prime graphGK(G). Denote byN(G)the set of nonidentity orders of conjugacy classes of elements inG. Alavi and Daneshkhah proved that the groups,Anwheren=p,p+1,p+2withs(G)≥2, are characterized byN(G). As a development of these topics, we will prove that ifGis a finite group with trivial center andN(G)=N(Ap+3)withp+2composite, thenGis isomorphic toAp+3.

scholarly journals Commuting Involution Graphs for Certain Exceptional Groups of Lie Type

2021 ◽  
Author(s):  
Ali Aubad ◽  
Peter Rowley
Keyword(s):  
Finite Group ◽  
Conjugacy Classes ◽  
Exceptional Groups ◽  
Vertex Set ◽  
Characteristic Two ◽  
A Finite Group ◽  
Groups Of Lie Type

AbstractSuppose that G is a finite group and X is a G-conjugacy classes of involutions. The commuting involution graph $${\mathcal {C}}(G,X)$$ C ( G , X ) is the graph whose vertex set is X with $$x, y \in X$$ x , y ∈ X being joined if $$x \ne y$$ x ≠ y and $$xy = yx$$ x y = y x . Here for various exceptional Lie type groups of characteristic two we investigate their commuting involution graphs.

scholarly journals Rainbow connectivity of the non-commuting graph of a finite group

2016 ◽  
Vol 15 (07) ◽  
pp. 1650127 ◽  
Author(s):  
Yulong Wei ◽  
Xuanlong Ma ◽  
Kaishun Wang
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Positive Integer ◽  
Abelian Groups ◽  
Connection Number ◽  
Commuting Graph ◽  
Rainbow Connection Number ◽  
Rainbow Connection ◽  
Vertex Set ◽  
A Finite Group

Let [Formula: see text] be a finite non-abelian group. The non-commuting graph [Formula: see text] of [Formula: see text] has the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text], where [Formula: see text] is the center of [Formula: see text]. We prove that the rainbow [Formula: see text]-connectivity of [Formula: see text] is [Formula: see text]. In particular, the rainbow connection number of [Formula: see text] is [Formula: see text]. Moreover, for any positive integer [Formula: see text], we prove that there exist infinitely many non-abelian groups [Formula: see text] such that the rainbow [Formula: see text]-connectivity of [Formula: see text] is [Formula: see text].

ON THE REGULAR GRAPH RELATED TO THE G-CONJUGACY CLASSES

2021 ◽  
pp. 1-5
Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Regular Graph ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
A Finite Group

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .

scholarly journals On the Number of Conjugacy Classes of a Finite Group

1993 ◽  
Vol 160 (2) ◽  
pp. 441-460 ◽  
Author(s):  
L.G. Kovacs ◽  
G.R. Robinson
Keyword(s):  
Finite Group ◽  
Conjugacy Classes ◽  
A Finite Group

Non-commuting graphs of certain almost simple groups

2019 ◽  
Vol 12 (05) ◽  
pp. 1950081
Author(s):  
M. Jahandideh ◽  
R. Modabernia ◽  
S. Shokrolahi
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Simple Group ◽  
Simple Groups ◽  
Almost Simple Group ◽  
Almost Simple Groups ◽  
Commuting Graph ◽  
Vertex Set

Let [Formula: see text] be a non-abelian finite group and [Formula: see text] be the center of [Formula: see text]. The non-commuting graph, [Formula: see text], associated to [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if and only if [Formula: see text]. We conjecture that if [Formula: see text] is an almost simple group and [Formula: see text] is a non-abelian finite group such that [Formula: see text], then [Formula: see text]. Among other results, we prove that if [Formula: see text] is a certain almost simple group and [Formula: see text] is a non-abelian group with isomorphic non-commuting graphs, then [Formula: see text].

scholarly journals Finite groups whose intersection power graphs are toroidal and projective-planar

2021 ◽  
Vol 19 (1) ◽  
pp. 850-862
Author(s):  
Huani Li ◽  
Xuanlong Ma ◽  
Ruiqin Fu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Identity Element ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

Abstract The intersection power graph of a finite group G G is the graph whose vertex set is G G , and two distinct vertices x x and y y are adjacent if either one of x x and y y is the identity element of G G , or ⟨ x ⟩ ∩ ⟨ y ⟩ \langle x\rangle \cap \langle y\rangle is non-trivial. In this paper, we completely classify all finite groups whose intersection power graphs are toroidal and projective-planar.

scholarly journals Integral Cayley Graphs over Abelian Groups

10.37236/353 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Walter Klotz ◽  
Torsten Sander
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Boolean Algebra ◽  
Cayley Graph ◽  
Cayley Graphs ◽  
Additive Group ◽  
Cyclic Groups ◽  
Vertex Set ◽  
A Finite Group ◽  
Gamma S

Let $\Gamma$ be a finite, additive group, $S \subseteq \Gamma, 0\notin S, -S=\{-s: s\in S\}=S$. The undirected Cayley graph Cay$(\Gamma,S)$ has vertex set $\Gamma$ and edge set $\{\{a,b\}: a,b\in \Gamma$, $a-b \in S\}$. A graph is called integral, if all of its eigenvalues are integers. For an abelian group $\Gamma$ we show that Cay$(\Gamma,S)$ is integral, if $S$ belongs to the Boolean algebra $B(\Gamma)$ generated by the subgroups of $\Gamma$. The converse is proven for cyclic groups. A finite group $\Gamma$ is called Cayley integral, if every undirected Cayley graph over $\Gamma$ is integral. We determine all abelian Cayley integral groups.

Sign in / Sign up

Export Citation Format

Share Document