No label defined (Q3772252)
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 4031733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4031733 |
Statements
1986
0 references
mean distance
0 references
connected graph
0 references
partition
0 references
0.8664833307266235
0 references
0.8553200364112854
0 references
0.8253880143165588
0 references
0.8078324794769287
0 references
[For the entire collection see Zbl 0608.00004.] The mean distance \(\mu\) (G) of a connected graph G is the average over all pairs \(\{\) u,v\(\}\) of distinct vertices of G of the distance between u and v. The author presents some results and conjectures concerning the effect of a vertex removal, an edge removal and a vertex set partition on the mean distance. In particular he conjectures that every connected (respectively two-edge connected) graph has a vertex (respectively an edge), whose removal increases the mean distance by less than a factor of 4/3. These two conjectures, known as four-third conjectures, have been partially proved by several people including the author, D. Bienstock; E. Györi and M. Kouider.
0 references