Average distance in weighted graphs with removed edges (Q2713629)
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: Average distance in weighted graphs with removed edges |
scientific article; zbMATH DE number 1602761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average distance in weighted graphs with removed edges |
scientific article; zbMATH DE number 1602761 |
Statements
10 June 2001
0 references
average distance
0 references
weighted graph
0 references
Average distance in weighted graphs with removed edges (English)
0 references
The average distance of a weighted graph \(G\) is the average of all distances between pairs of vertices in \(G\). It is proved that for \(k\geq 2\) any \(h\)-edge-connected weighted graph contains an edge whose removal does not increase the average distance by more than a factor \(h/(h-1)\). Examples for \(h=3\) are shown.
0 references
0.8450103998184204
0 references
0.8317937850952148
0 references
0.8307474851608276
0 references
0.8277593851089478
0 references
