Laplacian integral graphs with a given degree sequence constraint

DOI10.22199/ISSN.0717-6279-4735zbMATH Open1492.05094arXiv2009.11985OpenAlexW3088991157MaRDI QIDQ5065211FDOQ5065211

Authors: Anderson Fernandes Novanta, Carla Silva Oliveira, Leonardo Silva de Lima 

Publication date: 18 March 2022

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

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.

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

Recommendations

• Laplacian integral graphs with maximum degree 3
• On integral graphs with at most two vertices of degree larger than two
• Degree maximal graphs are Laplacian integral
• Laplacian integral subcubic signed graphs
• Constructably Laplacian integral graphs

zbMATH Keywords

eigenvaluesLaplacian matrix\(L\)-integral graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Title not available (Why is that?)
• Hamilton cycles and eigenvalues of graphs
• The Laplacian Spectrum of a Graph II
• Title not available (Why is that?)
• Spectra of graphs
• Laplacian graph eigenvectors
• A new characterization of \(P_{6}\)-free graphs
• Degree maximal graphs are Laplacian integral
• On graphs with equal algebraic and vertex connectivity
• Constructably Laplacian integral graphs
• Laplacian integral graphs in \(S(a, b)\)
• Laplacian integral graphs with maximum degree 3
• \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three

Cited In (9)

• 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
• The Laplacian polynomial of complete multipartite graphs

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)