Proximity, remoteness and maximum degree in graphs
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the average distances of the vertices of $G$, respectively. In...
Main Authors: | Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2022-11-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/9432/pdf |
Similar Items
-
Wiener index in graphs with given minimum degree and maximum degree
by: Peter Dankelmann, et al.
Published: (2021-06-01) -
The Degree-Diameter Problem for Outerplanar Graphs
by: Dankelmann Peter, et al.
Published: (2017-08-01) -
The quotients between the (revised) Szeged index and Wiener index of graphs
by: Huihui Zhang, et al.
Published: (2017-05-01) -
On the Connectivity of Token Graphs of Trees
by: Ruy Fabila-Monroy, et al.
Published: (2022-03-01) -
Characterising and recognising game-perfect graphs
by: Dominique Andres, et al.
Published: (2019-05-01)