English

Laplacian Spectra of Semigraphs

Combinatorics 2023-07-10 v1

Abstract

Consider a semigraph G=(V,E)G=(V,\,E); in this paper, we study the eigenvalues of the Laplacian matrix of GG. We show that the Laplacian of GG is positive semi-definite, and GG is connected if and only if λ2>0.\lambda_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.

Keywords

Cite

@article{arxiv.2307.03209,
  title  = {Laplacian Spectra of Semigraphs},
  author = {Pralhad M. Shinde},
  journal= {arXiv preprint arXiv:2307.03209},
  year   = {2023}
}

Comments

18 pages, 3 figures