Generating Graphs of Finite Dihedral Groups.

For a group G, the generating graph Γ (G) is defined as the graph with the vertex set G, and any two distinct vertices of Γ (G) are adjacent if they generate G. In this paper, we study the generating graph of D n , where D n is a Dihedral group of order 2n. We explore various graph theoretic properties, and determine complete spectrum of the adjacency and the Laplacian matrix of Γ (D n) . Moreover, we compute some distance and degree based topological indices of Γ (D n) . [ABSTRACT FROM AUTHOR]