加载中…
Let be an -vertex graph and be its signless Laplacian matrix. The -walk matrix of , denoted by , is , where is the all-one vector. Let be the graph obtained from and copies of the path by identifying the -th vertex of with an endvertex of the -th copy of for each . We prove that, holds for any . This gives a signless Laplacian counterpart of the following recently established identity [17]: where is the adjacency matrix of and . We also propose a conjecture to unify the above two equalities.

生成讲解博客的中文版本

生成AI智能校验的中文版本