Abstract
In this paper we define a simple undirected graph Og(Zn) whose vertices are all the elements of Zn and two distinct vertices a, b are adjacent if and only if gcd (O(a), O(b))= O(a·b) . We introduced that the graph Og(Zn) is complete graph for n=pq . where p, q are distinct prime. The graph Og(Zn) is not planar for n= p2 and n= 2k p. where, p is any odd prime and k > 1 . Also, discuss about Eulerian property of the graph and find degree of vertices and clique number of the graph.
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.
