On General Order Prime Graph of a Finite Group - Ii

Rajendra, R.; Reddy, P. Siva Kota; Siddalingaswamy, V. M.

doi:10.17654/dm017040437

Search citation statements

Order By: Relevance

Paper Sections

Select...

Results1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2024

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We find this results is very useful in the next section. (6) yields |G| ≤ M n. This bound is met by some groups as we will see later in Theorem (7).…”

Section: Resultsmentioning

confidence: 83%

See 1 more Smart Citation

Classification of Groups according to the number of end vertices in the coprime graph

Alraqad¹,

Saeed²,

Alshawarbeh³

2018

Preprint

View full text Add to dashboard Cite

In this paper we characterize groups according to the number of end vertices in the associated coprime graphs. An upper bound on the order of the group that depends on the number of end vertices is obtained. We also prove that 2−groups are the only groups whose coprime graphs have odd number of end vertices. Classifications of groups with small number of end vertices in the coprime graphs are given. One of the results shows that Z 4 and Z 2 × Z 2 are the only groups whose coprime graph has exactly three end vertices.

show abstract

“…We find this results is very useful in the next section. (6) yields |G| ≤ M n. This bound is met by some groups as we will see later in Theorem (7).…”

Section: Resultsmentioning

confidence: 83%

“…Later Ma et al [5] studied these graphs and called them coprime graphs of groups. Further studies of these graphs were done in [3,6,9].…”

Section: Introductionmentioning

confidence: 99%