Lower and upper bounds on graph communicabilities (Q6602318)
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 7910937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds on graph communicabilities |
scientific article; zbMATH DE number 7910937 |
Statements
Lower and upper bounds on graph communicabilities (English)
0 references
11 September 2024
0 references
matrix exponential
0 references
communicability
0 references
subgraph centrality
0 references
eigenvalues
0 references
combinatorial problems
0 references
0.7968164682388306
0 references
0.7292574644088745
0 references
0.715202808380127
0 references
0.7116502523422241
0 references
0.7089287638664246
0 references
