Order divisor graphs of finite groups
classification
🧮 math.CO
math.GR
keywords
graphsdividesgroupsadjacentalgebraicareabeendifferent
read the original abstract
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having different orders are adjacent provided that o(a) divides o(b) or o(b) divides o(a).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.