Öz, Mehmet Sinan2022-12-282022-12-282022https://doi.org/10.31801/cfsuasmas.1080426http://hdl.handle.net/20.500.12575/86564Let G be a graph. The energy of G is defined as the summation of absolute values of the eigenvalues of the adjacency matrix of G. It is possible to study several types of graph energy originating from defining various adjacency matrices defined by correspondingly different types of graph invariants. The first step is computing the characteristic polynomial of the defined adjacency matrix of G for obtaining the corresponding energy of G. In this paper, formulae for the coefficients of the characteristic polynomials of both the Randic and the Sombor adjacency matrices of path graph Pn , cycle graph Cn are presented. Moreover, we obtain the five coefficients of the characteristic polynomials of both Randic and Sombor adjacency matrices of a special type of 3−regular graph Rn.enGraphs, Randic matrix, Sombor matrix, paths, cycles, adjacencyArticle7137787901303-5991