On the sum of \(k\)-power of all distances in bipartite graphs (Q4640693)
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: On the sum of k-power of all distances in bipartite graphs |
scientific article; zbMATH DE number 6874562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum of \(k\)-power of all distances in bipartite graphs |
scientific article; zbMATH DE number 6874562 |
Statements
25 May 2018
0 references
bipartite graph
0 references
diameter
0 references
extremal graph
0 references
0.8987269997596741
0 references
0.8850218057632446
0 references
0.8442432284355164
0 references
0.8264507055282593
0 references
