Power Graphs of Finite Groups Determined by Hosoya Properties.

Suppose G is a finite group. The power graph represented by P(G) of G is a graph, whose node set is G, and two different elements are adjacent if and only if one is an integral power of the other. The Hosoya polynomial contains much information regarding graph invariants depending on the distance. In this article, we discuss the Hosoya characteristics (the Hosoya polynomial and its reciprocal) of the power graph related to an algebraic structure formed by the symmetries of regular molecular gones. As a consequence, we determined the Hosoya index of the power graphs of the dihedral and the generalized groups. This information is useful in determining the renowned chemical descriptors depending on the distance. The total number of matchings in a graph Γ is known as the