Abstract
Let G be a finite group. The intersection graph of G is a graph whose vertex set is the set of all proper non-trivial subgroups of G and two distinct vertices H and K are adjacent if and only if H∩K≠{e}, where e is the identity of the group G. In this paper, we investigate some properties and exploring the metric dimension and the resolving polynomial of the intersection graph of D 2p2 . We also find some topological indices such as Wiener, Hyper-Wiener, first and second Zagreb, Schultz, Gutman and eccentric connectivity indices of the intersection graph of D 2n for n=p 2 , where p is prime.
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.
