Энергия аддитивной связности типа Рандика графа

The Randic type additive connectivity matrix of the graph G of order n and size m is defined as RA(G)(Rij), where Rijdidj if the vertices vi and vj are adjacent, and Rij0 if vi and vj are not adjacent, where di and dj be the degrees of vertices vi and vj respectively. The purpose of this paper is to introduce and investigate the Randic type additive connectivity energy of a graph. In this paper, we obtain new inequalities involving the Randic type additive connectivity energy and presented upper and lower bounds for the Randic type additive connectivity energy of a graph. We also report results on Randic type additive connectivity energy of generalized complements of a graph.