On the sum of the squares of all distances in bipartite graphs with given connectivity (Q1706137)
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 the squares of all distances in bipartite graphs with given connectivity |
scientific article; zbMATH DE number 6851673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum of the squares of all distances in bipartite graphs with given connectivity |
scientific article; zbMATH DE number 6851673 |
Statements
On the sum of the squares of all distances in bipartite graphs with given connectivity (English)
0 references
21 March 2018
0 references
bipartite graph
0 references
vertex connectivity
0 references
edge connectivity
0 references
0.9490960836410522
0 references
0.8850218057632446
0 references
0.8557677268981934
0 references
0.8394718766212463
0 references
