Laplacian Spectra of Semigraphs
Abstract
Consider a semigraph G=(V,\,E); in this paper, we study the eigenvalues of the Laplacian matrix of G. We show that the Laplacian of G is positive semi-definite, and G is connected if and only if λ2 >0. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.