Randic, Seidel And Laplacian Energy Of NEPS Graphs

Abstract

Let be the simple graph, then we can obtained the energy of a graph by taking the absolute sum of the eigenvalues of the adjacency matrix of . In this research we have computed different energy invariants of the Non-completed Extended P-Sum (NEPS) of graph . In particular we investigate the Randic, Seidel and Laplacian energies of the NEPS of path graph

with any base . Here denotes number of vertices and denotes the number of copies of path graph . Our some of the results depend on the number of zeroes in base elements, for which we use the notation .