Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
From MaRDI portal
Publication:6185992
Recommendations
Cites work
- scientific article; zbMATH DE number 108394 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- A Characterization of Block-Graphs
- Algorithmic graph theory and perfect graphs
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Block duplicate graphs and a hierarchy of chordal graphs
- Block-indifference graphs: characterization, structural and spectral properties
- Completion of Laplacian integral graphs via edge addition
- Core-satellite graphs: clustering, assortativity and spectral properties
- Degree maximal graphs are Laplacian integral
- Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues
- Integer Laplacian eigenvalues of chordal graphs
- Multiplicity of integer roots of polynomials of graphs
- New results on Ptolemaic graphs
- Non-inclusion and other subclasses of chordal graphs
- On graphs whose Laplacian matrices have distinct integer eigenvalues
- On the Laplacian and signless Laplacian spectrum of a graph with \(k\) pairwise co-neighbor vertices
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- Split non-threshold Laplacian integral graphs
- Strictly chordal graphs are leaf powers
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
This page was built for publication: Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185992)