Randic energy of specific graphs
Abstract
Let G be a simple graph with vertex set V(G) = \v1, v2,..., vn\. The Randi\'c matrix of G, denoted by R(G), is defined as the n× n matrix whose (i,j)-entry is (didj)-12 if vi and vj are adjacent and 0 for another cases. Let the eigenvalues of the Randi\'c matrix R(G) be 1≥ 2≥ ...≥ n which are the roots of the Randi\'c characteristic polynomial Πi=1n (-i). The Randi\'c energy RE of G is the sum of absolute values of the eigenvalues of R(G). In this paper we compute the Randi\'c characteristic polynomial and the Randi\'c energy for specific graphs G.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.