Remoteness, proximity and few other distance invariants in graphs
Combinatorics
2020-10-22 v1
Abstract
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and minimal trees for the difference of remoteness and radius proving thus that the corresponding conjectures posed in [4] hold for trees.
Cite
@article{arxiv.1204.1184,
title = {Remoteness, proximity and few other distance invariants in graphs},
author = {Jelena Sedlar},
journal= {arXiv preprint arXiv:1204.1184},
year = {2020}
}
Comments
12 pages, 5 figures