1 research outputs found
Non-Conjugate Graphs Associated With Finite Groups
Let be a finite group and be a non-empty subset of comprising of the non-conjugate elements. In this study, we introduced the non-conjugate graph associated with with a coinciding set of vertices, such that two distinct vertices and are adjacent only if . We then discussed some fundamental properties to ensure the algebraic and combinatorial structure of the graph. Afterward, we formulated the resolving set and resolving polynomial for a subclass of dicyclic groups