关于图的拉普拉斯矩阵的第三不变因子的注记
A note on the third invariant factor of the Laplacian matrix of a graph
摘要:
设$G$是一个具有$n\geq 5$顶点的简单连通图.本文证明了$s_3(G)\leq n$,并刻画了满足$s_3(G)=n, n-1, n-2, $或$n-3$的图,其中$s_3(G)$是$G$的拉普拉斯矩阵的第三不变因子.
英文摘要:
Let $G$ be a simple connected graph with $n\geq 5$ vertices. In this note, we will prove that $s_3(G)\leq n$, and characterize the graphs which satisfy that $s_3(G)=n, n-1, n-2, $ or $n-3$, where $s_3(G)$ is the third invariant factor of the Laplacian matrix of $G$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。