On graphs with small number of Laplacian eigenvalues greater than two (Q1863532): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 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 graph eigenvectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Laplacian matrices of graphs: A survey / 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: On bipartite graphs with small number of laplacian eigenvalues greater than two and three / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the second largest eigenvalue of the laplacian matrix of a graph<sup>∗</sup> / rank | |||
Normal rank |
Latest revision as of 13:37, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On graphs with small number of Laplacian eigenvalues greater than two |
scientific article |
Statements
On graphs with small number of Laplacian eigenvalues greater than two (English)
0 references
11 March 2003
0 references
matching number
0 references
diameter
0 references
adjacency matrix
0 references
0 references