Graphs with fourth Laplacian eigenvalue less than two

DOI10.1016/S0195-6698(03)00069-6MaRDI QIDQ1404994zbMATH OpenFDO

Authors Xiao-Dong Zhang

Publication date 25 August 2003

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0195-6698(03)00069-6

zbMATH Keywords

Eigenvalues of graphsLaplacian eigenvaluesLaplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalues, singular values, and eigenvectors (15A18)

Review text

Let \(G\) be a simple graph with vertex set \(V\) such that \(n=|V|\geq 4\). Denote by \(D(G)= \text{diag}(\deg_v, v\in V)\) and \(A(G)\) the degree diagonal and the adjacency matrices of \(G\), respectively. \(L(G)= D(G)- A(G)\) is called the Laplacian matrix of \(G\). Clearly, \(L(G)\) is a positive semidefinite matrix. So the eigenvalues of \(L(G)\) are denoted by \(\lambda_1(G)\geq \lambda_2(G)\geq \lambda_3(G)\geq \lambda_4(G)\geq\cdots\geq \lambda_n(G)\geq 0\). In this paper, all connected graphs \(G\) with \(\lambda_4(G)< 2\) are determined, and especially all connected graphs \(G\) with \(\lambda_3(G)\geq 2> \lambda_4(G)\) are characterized. Moreover, the author determines the bipartite graphs with the property that the adjacency matrix of their line graph has exactly three nonnegative eigenvalues.

Recommendations

• Graphs with four distinct Laplacian eigenvalues
• Graphs with fourth largest signless-Laplacian eigenvalue less than two.
• Graphs with the second signless Laplacian eigenvalue \(\leq 4\)
• On graphs with largest Laplacian eigenvalue at most 4
• Graphs with at most Four Seidel Eigenvalues
• On graphs with small number of Laplacian eigenvalues greater than two
• On regular graphs with four distinct eigenvalues
• On graphs with three or four distinct normalized Laplacian eigenvalues
• Regular graphs with four eigenvalues
• scientific article; zbMATH DE number 6129422

Cites work

• A relation between the matching number and Laplacian spectrum of a graph
• Graph theory
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• scientific article; zbMATH DE number 4208111 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1054729 (Why is no real title available?)
• Laplacian matrices of graphs: A survey
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• On the second largest eigenvalue of line graphs
• The Laplacian Spectrum of a Graph

Cited in

(13)

• Bipartite graphs with small third Laplacian eigenvalue.
• On graphs with exactly three Q-eigenvalues at least two
• Mysteries around the graph Laplacian eigenvalue 4
• On bipartite graphs having minimum fourth adjacency coefficient
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• Nonsingular mixed graphs with few eigenvalues greater than two
• The eigenvalues of the graphs \(D(4,q)\)
• Graphs with small second largest Laplacian eigenvalue
• Signless Laplacian eigenvalues and circumference of graphs
• Non-bipartite graphs with third largest Laplacian eigenvalue less than three
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• Graphs with four distinct Laplacian eigenvalues
• On graphs whose third Laplacian matching root is small

This page was built for publication: Graphs with fourth Laplacian eigenvalue less than two

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