A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q827403 |
Changed an Item |
||
| Property / author | |||
| Property / author: Kinkar Chandra Das / rank | |||
Normal rank | |||
Revision as of 05:13, 21 February 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
