arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.00689math.COmath.SP
收藏

树的ABC谱半径排序

Ordering Trees by Their ABC Spectral Radii

Wenshui Lin, Zhangyong Yan, Peifang Fu, Jia-Bao Liu

摘要:

设$G=(V,E)$是一个连通图,其中$V=\{v_1, v_2, \cdots, v_n\}$ .令$d_i$表示顶点$v_i$的度。$G$的ABC矩阵定义为$M(G)=(m_{ij})_{n \times n}$,其中如果是$v_i v_j \in E$,则为$m_{ij}=\sqrt{(d_i + d_j -2)/(d_i d_j)}$,否则为0。$G$的ABC谱半径是$M(G)$的最大本征值。在本文中,我们建立了两个关于ABC谱半径的图扰动。通过应用这些扰动,确定了具有第三、第四和第五大ABC谱半径的树。

英文摘要:

Let $G=(V,E)$ be a connected graph, where $V=\{v_1, v_2, \cdots, v_n\}$. Let $d_i$ denote the degree of vertex $v_i$. The ABC matrix of $G$ is defined as $M(G)=(m_{ij})_{n \times n}$, where $m_{ij}=\sqrt{(d_i + d_j -2)/(d_i d_j)}$ if $v_i v_j \in E$, and 0 otherwise. The ABC spectral radius of $G$ is the largest eigenvalue of $M(G)$. In the present paper, we establish two graph perturbations with respect to ABC spectral radius. By applying these perturbations, the trees with the third, fourth, and fifth largest ABC spectral radii are determined.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑