English

Randic energy of specific graphs

Combinatorics 2014-11-11 v1

Abstract

Let GG be a simple graph with vertex set V(G)={v1,v2,...,vn}V(G) = \{v_1, v_2,..., v_n\}. The Randi\'{c} matrix of GG, denoted by R(G)R(G), is defined as the n×nn\times n matrix whose (i,j)(i,j)-entry is (didj)12(d_id_j)^{\frac{-1}{2}} if viv_i and vjv_j are adjacent and 00 for another cases. Let the eigenvalues of the Randi\'{c} matrix R(G)R(G) be ρ1ρ2...ρn\rho_1\geq \rho_2\geq ...\geq \rho_n which are the roots of the Randi\'c characteristic polynomial i=1n(ρρi)\prod_{i=1}^n (\rho-\rho_i). The Randi\'{c} energy RERE of GG is the sum of absolute values of the eigenvalues of R(G)R(G). In this paper we compute the Randi\'c characteristic polynomial and the Randi\'c energy for specific graphs GG.

Keywords

Cite

@article{arxiv.1411.2544,
  title  = {Randic energy of specific graphs},
  author = {Saeid Alikhani and Nima Ghanbari},
  journal= {arXiv preprint arXiv:1411.2544},
  year   = {2014}
}

Comments

15 pages, 2 figures

R2 v1 2026-06-22T06:53:55.080Z