Integer Laplacian eigenvalues of strictly chordal graphs
From MaRDI portal
Publication:6345012
arXiv2007.06681MaRDI QIDQ6345012FDOQ6345012
Authors: Nair Abreu, Claudia Justel, Lilian Markenzon 
Publication date: 13 July 2020
Abstract: In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be efficiently implemented. Firstly we review results concerning general graphs showing that the number of universal vertices and the degree of false and true twins provide integer Laplacian eigenvalues and their multiplicities. Afterwards, we prove that many integer Laplacian eigenvalues of a strictly chordal graph are directly related to particular simplicial vertex sets and to the minimal vertex separators of the graph.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
This page was built for publication: Integer Laplacian eigenvalues of strictly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345012)
