2016
DOI: 10.1142/s1793830916500476
|View full text |Cite
|
Sign up to set email alerts
|

Permutability graphs of subgroups of some finite non-abelian groups

Abstract: In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups Dn, the generalized quaternion groups Qn, the quasi-dihedral groups QD 2 n and the modular groups M p n . Further, we investigate the number of edges, degrees of the vertices, independence number, dominating number, clique number, chromatic number, weakly perfectness, Eulerianness, Hamiltonicity of these graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Since m is a divisor of 4n, by elementary group theory, there exists a subgroup H (m) of order m in Dic n (cf. [19]). Then it is easy to see that K t×m ∼ = Cay(Dic n , Dic n \ H (m) ).…”
Section: Notation Denote By Dicmentioning
confidence: 99%
See 1 more Smart Citation
“…Since m is a divisor of 4n, by elementary group theory, there exists a subgroup H (m) of order m in Dic n (cf. [19]). Then it is easy to see that K t×m ∼ = Cay(Dic n , Dic n \ H (m) ).…”
Section: Notation Denote By Dicmentioning
confidence: 99%
“…Also, it is easy to see that V (Γ + ) acts regularly on itself by left multiplication as a subgroup of Aut(Γ + ). Since every subgroup of Dic n is cyclic or dicyclic (cf [19]…”
mentioning
confidence: 99%
“…The intersection graph of is an undirected simple (without loops and multiple edges) graph whose vertex-set consists of all nontrivial proper subgroups of for which two distinct vertices H and K of are adjacent if ⋂ is a nontrivial subgroup of . This kind of graph has been studied by researchers; we refer the reader to see [2][3][4][5][6]. Let be any graph.…”
Section: Introductionmentioning
confidence: 99%