|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
22 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Extremal total distance of graphs of given radius I | | Stijn Cambie
; | | Date: |
1 Jan 2022 | | Abstract: | In 1984, PlesnÃk determined the minimum total distance for given order
and diameter and characterized the extremal graphs and digraphs. We prove the
analog for given order and radius, when the order is sufficiently large
compared to the radius. This confirms asymptotically a conjecture of Chen et
al. We also state an analog of the conjecture of Chen et al for digraphs and
prove it for sufficiently large order. | | Source: | arXiv, 2201.00185 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER