Generating graphs of finite dihedral groups (Q6136239)

A group \(G\) is said to be two generated if there exists a pair of elements that generates \(G\). The generating graph of \(G\), denoted by \(\Gamma(G)\), is a graph whose vertex set is \(G\), and any two distinct vertices are adjacent if they generate \(G\). It is natural to consider only two generated groups; otherwise, the generating graphs are empty graphs. The basic idea behind generating graphs is the generation of groups by two of its elements, which was first studied from a probabilistic perspective. The authors here probe the generating graph of \(D_n\), where \(D_n\) is a dihedral group of order \(2n\). They explore various graph-theoretic properties and determine the complete spectrum of the adjacency and the Laplacian matrix of \(\Gamma(D_n)\). They also compute some distance and degree-based topological indices of \(\Gamma(D_n)\).