2018
DOI: 10.5269/bspm.v36i3.31678
|View full text |Cite
|
Sign up to set email alerts
|

The stable subgroup graph

Abstract: In this paper we introduce stable subgroup graph associated to the group G. It is a graph with vertex set all subgroups of G and two distinct subgroupsThe planarity of the stable subgroup graph of solvable groups has been discussed. Finally, the induced subgraph of stable subgroup graph with vertex set whole non-normal subgroups is considered and its planarity is verified for some certain groups.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Based on definition 3, the vertices of the non-normal subgroup graph are all the elements of 𝐴 4 and the direction of the edges is determined by the product of the two distinct elements. The following GAP coding is for one of the subgroups of the alternating group of order 12. gap> A4:=AlternatingGroup(4); Alt( [ 1 .. 4 ] ) gap> e:=Elements(A4); [ (), (2,3,4), (2,4,3), (1,2) (3,4), (1,2,3), (1,2,4), (1,3,2), (1,3,4), (1,3)(2,4), (1,4,2), (1,4,3), (1,4) Group([ (1,2)(3,4) ]) gap> Elements(H1); [ (), (1,2)(3,4) ] gap> for i in e do > for j in e do; > if i<>j then > c:=i*j; > d:=c in H1; > if (d=true) then > Print ("{",i,",",j,",",c,",",d,"},"); > fi; > fi; > od; > od; {(),(1,2) (3,4),(1,2)(3,4),true},{(2,3,4), (2,4,3),(),true},{ (2,3,4), (1,2 ,3),(1,2)(3,4),true},{(2,4,3), (2,3,4),(),true},{ (2,4,…”
Section: Gap Codingmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on definition 3, the vertices of the non-normal subgroup graph are all the elements of 𝐴 4 and the direction of the edges is determined by the product of the two distinct elements. The following GAP coding is for one of the subgroups of the alternating group of order 12. gap> A4:=AlternatingGroup(4); Alt( [ 1 .. 4 ] ) gap> e:=Elements(A4); [ (), (2,3,4), (2,4,3), (1,2) (3,4), (1,2,3), (1,2,4), (1,3,2), (1,3,4), (1,3)(2,4), (1,4,2), (1,4,3), (1,4) Group([ (1,2)(3,4) ]) gap> Elements(H1); [ (), (1,2)(3,4) ] gap> for i in e do > for j in e do; > if i<>j then > c:=i*j; > d:=c in H1; > if (d=true) then > Print ("{",i,",",j,",",c,",",d,"},"); > fi; > fi; > od; > od; {(),(1,2) (3,4),(1,2)(3,4),true},{(2,3,4), (2,4,3),(),true},{ (2,3,4), (1,2 ,3),(1,2)(3,4),true},{(2,4,3), (2,3,4),(),true},{ (2,4,…”
Section: Gap Codingmentioning
confidence: 99%
“…These graphs were using the cyclic subgroups as vertices and two distinct subgroups are adjacent if one of them is a subset of the other. Then, more graphs were constructed using subgroups which are stable subgroup graph defined by Tolue [2] and normal subgroup-based power graph defined by Bhuniya and Sudip Bera [3]. Most of the research on graphs associated with the finite group were simple undirected graphs.…”
Section: Introductionmentioning
confidence: 99%