A complete characterization of spectra of the Randic matrix of level-wise regular trees

preprint2024arXivOpen access

Abstract

Let GG be a simple finite connected graph with vertex set V(G)={v1,v2,…,vn}V(G) = \{v_1,v_2,\ldots,v_n\}. Denote the degree of vertex viv_i by did_i for all 1≤i≤n1 \leq i \leq n. The Randić matrix of GG, denoted by R(G)=[ri,j]R(G) = [r_{i,j}], is the n×nn \times n matrix whose (i,j)(i,j)-entry ri,jr_{i,j} is ri,j=1/didjr_{i,j} = 1/\sqrt{d_id_j} if viv_i and vjv_j are adjacent in GG and 0 otherwise. A tree is a connected acyclic graph. A level-wise regular tree is a tree rooted at one vertex rr or two (adjacent) vertices rr and r′r' in which all vertices with the minimum distance ii from rr or r′r' have the same degree mim_i for 0≤i≤h0 \leq i \leq h, where hh is the height of TT. In this paper, we give a complete characterization of the eigenvalues with their multiplicity of the Randić matrix of level-wise regular trees. We prove that the eigenvalues of the Randić matrix of a level-wise regular tree are the eigenvalues of the particular tridiagonal matrices, which are formed using the degree sequence (m0,m1,…,mh−1)(m_0,m_1,\ldots,m_{h-1}) of level-wise regular trees.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.