Integer Laplacian Eigenvalues of Chordal Graphs
Abstract
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and algebraic connectivities, by means of the vertices that compose the minimal vertex separators of the graph; we stablish a sufficient condition for the cardinality of a maximal clique to appear as an integer Laplacian eigenvalue. Finally, we review two subclasses of chordal graphs, showing for them some new properties.
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.