Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.12777 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909078061580288 |
|---|---|
| author | Aouchiche, Mustapha Rather, Bilal Ahmad |
| author_facet | Aouchiche, Mustapha Rather, Bilal Ahmad |
| contents | The proximity $π= π(G)$ of a connected graph $G$ is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by $ρ= ρ(G)$. The concepts of proximity and remoteness, first defined in 2006, attracted the attention of several researchers in Graph Theory. Their investigation led to a considerable number of publications. In this paper, we present a survey of the research work. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_12777 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Proximity and Remoteness in Graphs: a survey Aouchiche, Mustapha Rather, Bilal Ahmad Combinatorics 05C12, 05C35, 15A18 The proximity $π= π(G)$ of a connected graph $G$ is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by $ρ= ρ(G)$. The concepts of proximity and remoteness, first defined in 2006, attracted the attention of several researchers in Graph Theory. Their investigation led to a considerable number of publications. In this paper, we present a survey of the research work. |
| title | Proximity and Remoteness in Graphs: a survey |
| topic | Combinatorics 05C12, 05C35, 15A18 |
| url | https://arxiv.org/abs/2310.12777 |