当前位置: 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 multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices
Linear and Multilinear Algebra ( IF 1.1 ) Pub Date : 2020-10-29 , DOI: 10.1080/03081087.2020.1838424
Xinlei Wang 1 , Dein Wong 1 , Liangli Wei 2 , Fenglei Tian 3
Affiliation  

ABSTRACT

Let T be a tree with vertex set V(T)={v1,v2,,vn}. The adjacency matrix A(T) of T is an n×n matrix (aij), where aij=aji=1 if vi is adjacent to vj and aij=0 if otherwise. In this paper, we consider the multiplicity of 1 as an eigenvalue of A(T), which is written as m(T,1). It is proved that among all trees T with p 2 pendant vertices, the maximum value of m(T,1) is p−1, and for a tree T with p2 pendant vertices, m(T,1)=p1 if and only if T=Pn with n2(mod 3), or T is a tree in which d(v,u)2(mod 3) for any pendant vertex v and any major vertex u of T, where a major vertex is a vertex of degree at least 3 and d(v,u) is the distance between v and u.



中文翻译:

作为具有给定数量下垂顶点的树的特征值的重数 -1

摘要

T为一棵有顶点集的树()={v1,v2,,vn}. 邻接矩阵一个()T是一个n×n矩阵(一个一世j), 在哪里一个一世j=一个j一世=1如果v一世毗邻vj一个一世j=0否则。在本文中,我们考虑多重性-1作为特征值一个(), 写成(,-1). 证明了在所有树Tp 2悬垂顶点,最大值(,-1)p -1,并且对于具有p2垂饰顶点,(,-1)=p-1当且仅当=nn2(d 3), 或T是一棵树,其中d(v,)2(d 3)对于T的任何下垂顶点v和任何主顶点u,其中主顶点是度数至少为 3 的顶点,并且d(v,)是vu之间的距离。

更新日期:2020-10-29
down
wechat
bug