Abstract
Given a finite group G with a subset where is a prime. The -graphs denoted by whose vertices are the elements of and where two distinct vertices and are adjacent if or . The algebraic structure of such -graphs has been investigated using Java programming language with NetBeans IDE. Then, a method is proposed to convert the graph structure to a group-like form.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
