On Order Prime Divisor Graphs of Finite Groups
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x) denotes the order of an element x ∈ G. In this pa...
| الحاوية / القاعدة: | Discussiones Mathematicae - General Algebra and Applications |
|---|---|
| المؤلفون الرئيسيون: | , , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
University of Zielona Góra
2021-11-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://doi.org/10.7151/dmgaa.1372 |