English

On Intersection Graph of Dihedral Group

Combinatorics 2021-01-01 v3

Abstract

Let GG be a finite group. The intersection graph of GG is a graph whose vertex set is the set of all proper non-trivial subgroups of GG and two distinct vertices HH and KK are adjacent if and only if HK{e}H\cap K \neq \{e\}, where ee is the identity of the group GG. In this paper, we investigate some properties and exploring some topological indices such as Wiener, Hyper-Wiener, first and second Zagreb, Schultz, Gutman and eccentric connectivity indices of the intersection graph of D2nD_{2n} for n=p2n=p^2, pp is prime. We also find the metric dimension and the resolving polynomial of the intersection graph of D2p2D_{2p^2}.

Keywords

Cite

@article{arxiv.2011.10544,
  title  = {On Intersection Graph of Dihedral Group},
  author = {Sanhan Khasraw},
  journal= {arXiv preprint arXiv:2011.10544},
  year   = {2021}
}
R2 v1 2026-06-23T20:24:08.455Z