Graphs with fourth Laplacian eigenvalue less than two (Q1404994): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Xiao Dong Zhang / rank | |||
Property / reviewed by | |||
Property / reviewed by: Kokichi Sakai / rank | |||
Property / author | |||
Property / author: Xiao Dong Zhang / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Kokichi Sakai / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4327350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Laplacian Spectrum of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A relation between the matching number and Laplacian spectrum of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3356331 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Laplacian matrices of graphs: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4352274 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On bipartite graphs with small number of laplacian eigenvalues greater than two and three / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the second largest eigenvalue of line graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with constant \(\mu\) and \(\overline{\mu}\) / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:17, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs with fourth Laplacian eigenvalue less than two |
scientific article |
Statements
Graphs with fourth Laplacian eigenvalue less than two (English)
0 references
25 August 2003
0 references
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.
0 references
Laplacian eigenvalues
0 references
Eigenvalues of graphs
0 references
Laplacian matrix
0 references
0 references