Matrix power inequalities and the number of walks in graphs (Q403573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Matrix power inequalities and the number of walks in graphs |
scientific article; zbMATH DE number 6336063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matrix power inequalities and the number of walks in graphs |
scientific article; zbMATH DE number 6336063 |
Statements
Matrix power inequalities and the number of walks in graphs (English)
0 references
29 August 2014
0 references
inequalities
0 references
matrix power
0 references
sum of entries
0 references
adjacency matrix
0 references
number of walks
0 references
nonnegative matrix
0 references
Hermitian matrix
0 references
spectral radius
0 references
largest eigenvalue
0 references
0.8946546912193298
0 references
0.865703284740448
0 references
0.8037343621253967
0 references
0.7712172269821167
0 references
0.7607957720756531
0 references
