加载中…
Consider a semigraph ; in this paper, we study the eigenvalues of the Laplacian matrix of . We show that the Laplacian of is positive semi-definite, and is connected if and only if Along the similar lines of graph theory bounds on the largest eigenvalue, we obtain upper and lower bounds on the largest Laplacian eigenvalue of G and enumerate the Laplacian eigenvalues of some special semigraphs such as star semigraph, rooted 3-uniform semigraph tree.

生成讲解博客的中文版本

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