Integer Laplacian eigenvalues of chordal graphs

DOI10.1016/J.LAA.2019.12.030MaRDI QIDQ2229473zbMATH OpenOpenAlexWikidataFDO

Authors Claudia Justel, Lilian Markenzon, Nair Abreu

Publication date 17 February 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.04979

zbMATH Keywords

algebraic connectivitychordal graphsinteger Laplacian eigenvaluesstructural properties

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

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.

Recommendations

• The Laplacian spectra of graphs with a tree structure
• On the graphs with larger Laplacian eigenvalues equal to two
• On the Laplacian integral tricyclic graphs
• Laplacian integral graphs with a given degree sequence constraint
• On graphs whose Laplacian matrices have distinct integer eigenvalues

Cites work

• Algorithmic graph theory and perfect graphs
• Block-indifference graphs: characterization, structural and spectral properties
• Core-satellite graphs: clustering, assortativity and spectral properties
• Graph Classes: A Survey
• scientific article; zbMATH DE number 4179413 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Laplacian spectrum of weakly quasi-threshold graphs
• On algebraic connectivity of graphs with at most two points of articulation in each block
• On graphs with equal algebraic and vertex connectivity
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• Quasi-threshold graphs
• Split non-threshold Laplacian integral graphs
• The Comparability Graph of a Tree
• Trivially perfect graphs

Cited in

(6)

• Relationships between algebraic connectivity and vertex connectivity
• Block-indifference graphs: characterization, structural and spectral properties
• Steklov eigenvalue problem on subgraphs of integer lattices
• Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
• A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
• Characterization of \textit{quasi}-threshold graphs with two main \(Q\)-eigenvalues

This page was built for publication: Integer Laplacian eigenvalues of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229473)