Computation of general Randić polynomial and general Randić energy of some graphs (Q2209463)

The general Randić matrix of a graph \(G\) of order \(n\), denoted by \(\operatorname{GR}(G)\), is the \(n \times n\) matrix whose \((i, j)\)-entry is \((d_{i}d_{j})^{\alpha}\), \(\alpha \in \mathbb{R}\), if the vertices \(v_i\) and \(v_j\) are adjacent and \(0\) otherwise, where \(d_{i}\) is the degree of \(v_{i}\) for \(i = 1, \ldots, n\). The general Randić polynomial of \(G\) is simply the characteristic polynomial of \(\operatorname{GR}(G)\), and the general Randić energy \(\operatorname{EGR}(G)\) of \(G\) is defined as the sum of the absolute values of the eigenvalues of \(\operatorname{GR}(G)\). In the particular case when \(\alpha = -\frac{1}{2}\), \(\operatorname{EGR}(G)\) is the usual Randić energy of \(G\). In this paper, the authors compute the general Randić polynomial and the general Randić energy of paths, cycles, complete graphs, complete bipartite graphs, friendship graphs and Dutch windmill graphs.