A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2003.06.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997900391 / rank | |||
Normal rank | |||
Revision as of 21:51, 19 March 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
