A coprime graph is a representation of finite groups on graphs by defining the vertex graph as an element in a group and two vertices adjacent to each other's if and only if the order of the two elements is coprime. In this research, we discuss the generalized Quaternion group and its properties. Then we discuss the properties of the coprime graph over the generalized Quaternion group by looking at its Eulerian, Hamiltonian, and Planarity sides. In general, the coprime graphs of the generalized quaternion group are not Eulerian, not Hamilton, and not planar graphs. The coprime graph of the generalized quaternion group is a planar graph if for a natural number.
Collaboration network of the authors
3 authors ·
2 co-authorship links
· 1 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Sunan Kalijaga State Islamic University Yogyakarta
Universitas Islam Negeri Ar-Raniry
Affiliation unknown
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.