The intersection graph of a finite group G is a graph (V,E) where V is a set of all non-trivial subgroups of G and E is a set of edges where two distinct subgroups H_i , H_j  are said to be adjacent if and only if H_i \cap H_j \neq {e} . This study discusses the intersection graph of a dihedral group D_{2n} specifically the subgraph, degree of vertices, radius, diameter, girth, and domination number. From this study, we obtained that if n=p^2 then the intersection graph of D_{2n} is containing complete subgraph K_{p+2} and \gamma(\Gamma_{D_{2n}})=p.

The coprime graph of a finite group was defined by Ma, denoted by ΓG, is a graph with vertices that are all elements of group G and two distinct vertices x and y are adjacent if and only if (|x|, |y|) = 1. In this study, we discuss numerical invariants of a generalized quaternion group. The numerical invariant is a property of a graph in numerical value and that value is always the same on an isomorphic graph. This research is fundamental research and analysis based on patterns in some examples. Some results of this research are the independence number of ΓQ4n is 4n − 1 or 3n and its complement metric dimension is 4n − 2 for each n ≥ 2.