A new upper bound on the largest normalized Laplacian eigenvalue (Q2852253)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6213941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound on the largest normalized Laplacian eigenvalue |
scientific article; zbMATH DE number 6213941 |
Statements
A new upper bound on the largest normalized Laplacian eigenvalue (English)
0 references
8 October 2013
0 references
normalized Laplacian matrix
0 references
Randić matrix
0 references
upper bound
0 references
largest eigenvalue
0 references
subdominant eigenvalue
0 references
The authors prove that the largest normalized Laplacian eigenvalue \(\lambda_1\) of a simple connected graph \(G\) is bounded from above by NEWLINE\[NEWLINE 2-\min_{i\sim j} \left\{ \frac{|N_i\cap N_j|}{\max\{d_i,d_j\}} \right\}, NEWLINE\]NEWLINE where the minimum is taken over all pairs of adjacent vertices \(i\), \(j\) (here \(N_i\) is the set of vertices adjacent to \(i\) and \(d_i=|N_i|\) is the degree of \(i\)).
0 references
0.8933287262916565
0 references
0.885688066482544
0 references
0.8783112168312073
0 references
0.8713611364364624
0 references
0.8652797937393188
0 references
