On graphs with small number of Laplacian eigenvalues greater than two

DOI10.1016/S0024-3795(02)00458-5MaRDI QIDQ1863532zbMATH OpenFDO

Authors Yizheng Fan, Jiongsheng Li

Publication date 11 March 2003

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

Full work available at URL https://doi.org/10.1016/S0024-3795(02)00458-5

zbMATH Keywords

adjacency matrixdiametermatching number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• A relation between the matching number and Laplacian spectrum of a graph
• Eigenvalues of the Laplacian of a graph^∗
• scientific article; zbMATH DE number 4208111 (Why is no real title available?)
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• The Laplacian Spectrum of a Graph

Cited in

(9)

• Graphs with fourth Laplacian eigenvalue less than two
• On graphs with at most three Laplacian eigenvalues greater than or equal to two.
• On graphs with exactly three Q-eigenvalues at least two
• Nonsingular mixed graphs with few eigenvalues greater than two
• Signless Laplacian eigenvalues and circumference of graphs
• Small graphs with exactly two non-negative eigenvalues
• On graphs whose third Laplacian matching root is small
• Graphs whose Laplacian eigenvalues are almost all 1 or 2
• On the eigenvalue two and matching number of a tree

This page was built for publication: On graphs with small number of Laplacian eigenvalues greater than two

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