加载中…
A universal adjacency matrix of a graph with adjacency matrix is any matrix of the form with $\alpha \neq 0IJDG$ is the disjoint union of regular graphs, we present an expression for the characteristic polynomials of the various universal adjacency matrices in terms of the characteristic polynomials of the adjacency matrices of the components. As a consequence we obtain a formula for the characteristic polynomial of the Seidel matrix of , and the signless Laplacian of the complement of (i.e. the join of regular graphs).

生成讲解博客的中文版本

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