arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.13279math.CO
收藏

关于Dynkin图$D_n$的行走矩阵

On the walk matrix of the Dynkin graph $D_n$

Wei Wang, Chuanming Wang, Songlin Guo

摘要:

令$W(D_n)$表示Dynkin图$D_n$的行走矩阵,Dynkin图是通过在第二个顶点处添加悬垂边而从$n-1$阶的路获得的树。我们证明了$\text{rank}\,W(D_n)=n-2$如果$4\mid n$和$\text{rank}\,W(D_n)=n-1$否则。进一步证明了当$4\nmid n$时,$W(D_n)$的Smith规范型是$$\text{diag}[\underbrace{1,1,\ldots,1}_{\lceil\frac{n}{2}\rceil},\underbrace{2,2,\ldots,2}_{\lfloor\frac{n}{2}\rfloor-1},0]$$.这证实了[W.Wang,F.Liu,W.Wang,几乎可控图的广义谱特征,欧洲J.Combin.,96(2021):103348]。

英文摘要:

Let $W(D_n)$ denote the walk matrix of the Dynkin graph $D_n$, a tree obtained from the path of order $n-1$ by adding a pendant edge at the second vertex. We prove that $\text{rank}\,W(D_n)=n-2$ if $4\mid n$ and $\text{rank}\,W(D_n)=n-1$ otherwise. Furthermore, we prove that the Smith normal form of $W(D_n)$ is $$\text{diag}[\underbrace{1,1,\ldots,1}_{\lceil\frac{n}{2}\rceil},\underbrace{2,2,\ldots,2}_{\lfloor\frac{n}{2}\rfloor-1},0]$$ when $4\nmid n$. This confirms a recent conjecture in [W.Wang, F.Liu, W.Wang, Generalized spectral characterizations of almost controllable graphs, European J. Combin., 96(2021):103348].

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

↑