Linear and Multilinear Algebra ( IF 1.1 ) Pub Date : 2023-03-15 , DOI: 10.1080/03081087.2023.2187014 Aditi Howlader 1 , Pratima Panigrahi 1
For positive integers , a generalized balanced tree is a rooted tree of height h such that every vertex of depth i has children, . The distance matrix of a simple connected graph G of order n is an matrix whose entry is the distance between and vertices. A connected graph G is called a k-partitioned transmission regular graph if there exists a vertex partition of G so that for , and , is a constant. Here we show that is an -partitioned transmission regular graph. We find an matrix whose largest eigenvalue is the distance spectral radius of . We obtain the characteristic polynomial of in terms of that of the smaller matrices and give an idea to find the full spectrum. Moreover, we get that has an eigenvalue with multiplicity at least and as eigenvalues with multiplicity at least .
中文翻译:
关于广义平衡树的距离谱
对于正整数, 一棵广义平衡树是一棵高度为h的有根树,深度为i的每个顶点都有孩子们,. 距离矩阵一个n阶的简单连通图G是一个矩阵其输入是之间的距离和顶点。如果存在顶点划分,则连通图G称为k划分传输正则图G这样对于, 和,是一个常数。在这里我们表明是一个-分区传输正则图。我们找到一个其最大特征值是距离谱半径的矩阵. 我们得到的特征多项式根据较小的矩阵,并给出找到完整光谱的想法。此外,我们得到有至少具有多重性的特征值和作为至少具有多重性的特征值.