当前位置: X-MOL 学术Linear Multilinear Algebra › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the distance spectrum of generalized balanced trees
Linear and Multilinear Algebra ( IF 1.1 ) Pub Date : 2023-03-15 , DOI: 10.1080/03081087.2023.2187014
Aditi Howlader 1 , Pratima Panigrahi 1
Affiliation  

For positive integers m1,m2,,mh, a generalized balanced tree T(m1,m2,,mh) is a rooted tree of height h such that every vertex of depth i has mi+1 children, 0ih1. The distance matrix D(G) of a simple connected graph G of order n is an n×n matrix whose (i,j)th entry is the distance between ith and jth vertices. A connected graph G is called a k-partitioned transmission regular graph if there exists a vertex partition {V1,V2,,Vk} of G so that for 1i,jk, and xVi, yVjd(x,y) is a constant. Here we show that T(m1,m2,,mh) is an (h+1)-partitioned transmission regular graph. We find an (h+1)×(h+1) matrix whose largest eigenvalue is the distance spectral radius of T(m1,m2,,mh). We obtain the characteristic polynomial of D(T(m1,m2,,mh)) in terms of that of the smaller matrices and give an idea to find the full spectrum. Moreover, we get that D(T(m1,m2,,mh)) has 2 an eigenvalue with multiplicity at least m1mh1(mh1) and (mh+2)±mh(mh+4) as eigenvalues with multiplicity at least m1mh2(mh11).



中文翻译:

关于广义平衡树的距离谱

对于正整数1个,2个,……,H, 一棵广义平衡树(1个,2个,……,H)是一棵高度为h的有根树,深度为i的每个顶点都有+1个孩子们,0H1个. 距离矩阵(G)一个n阶的简单连通图G是一个n×n矩阵其(,j)输入是之间的距离j顶点。如果存在顶点划分,则连通图G称为k划分传输正则图{V1个,V2个,……,Vk}G这样对于1个,jk, 和XV,Vjd(X,)是一个常数。在这里我们表明(1个,2个,……,H)是一个(H+1个)-分区传输正则图。我们找到一个(H+1个)×(H+1个)其最大特征值是距离谱半径的矩阵(1个,2个,……,H). 我们得到的特征多项式((1个,2个,……,H))根据较小的矩阵,并给出找到完整光谱的想法。此外,我们得到((1个,2个,……,H))2个至少具有多重性的特征值1个H1个(H1个)(H+2个)±H(H+4个)作为至少具有多重性的特征值1个H2个(H1个1个).

更新日期:2023-03-15
down
wechat
bug