A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.laa.2003.06.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.LAA.2003.06.009 / rank | |||
Normal rank | |||
Latest revision as of 19:45, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. |
scientific article |
Statements
A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (English)
0 references
3 December 2003
0 references
Graph
0 references
Laplacian matrix
0 references
Largest eigenvalue
0 references
Upper bound
0 references
