Abstract
Let G be a finite group. The probability of a random pair of elements in G are said to be co-prime when the greatest common divisor of order x and y, where x and y in G, is equal to one. Meanwhile the co-prime graph of a group is defined as a graph whose vertices are elements of G and two distinct vertices are adjacent if and only if the greatest common divisor of order x and y is equal to one. In this paper, the co-prime probability and its graph such as the type and the properties of the graph are determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
