Laplacian integral graphs with a given degree sequence constraint
From MaRDI portal
Publication:5065211
Abstract: Let G be a graph on n vertices. The Laplacian matrix of G, denoted by L(G), is defined as L(G) = D(G) - A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the vertex degrees of G. A graph G is said to be L-integral is all eigenvalues of the matrix L(G) are integers. In this paper, we characterize all L-integral non-bipartite graphs among all connected graphs with at most two vertices of degree larger than or equal to three.
Recommendations
Cites work
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A new characterization of \(P_{6}\)-free graphs
- Constructably Laplacian integral graphs
- Degree maximal graphs are Laplacian integral
- Hamilton cycles and eigenvalues of graphs
- Laplacian graph eigenvectors
- Laplacian integral graphs in S(a, b)
- Laplacian integral graphs with maximum degree 3
- On graphs with equal algebraic and vertex connectivity
- Spectra of graphs
- The Laplacian Spectrum of a Graph II
- \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three
Cited in
(9)- The Laplacian polynomial of complete multipartite graphs
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs
- Completion of Laplacian integral graphs via edge addition
- On graphs whose Laplacian matrices have distinct integer eigenvalues
- Integer Laplacian eigenvalues of chordal graphs
- Laplacian integral graphs with maximum degree 3
- On integer matrices with integer eigenvalues and Laplacian integral graphs
- Indecomposable Laplacian integral graphs
- The Laplacian Spectrum of a Graph II
This page was built for publication: Laplacian integral graphs with a given degree sequence constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065211)