The average distance of a vertex $v$ connected graph $G$ is the arithmetic mean distances from to all other vertices $G$. proximity $\pi(G)$ and remoteness $\rho(G)$ are minimum maximum $G$, respectively. In this paper, we give upper bounds on for graphs given order, degree degree. Our sharp apart an additive constant.

In this paper, we provide degree distributions for $AB$ random geometric graphs, in which points of type $A$ connect to the closest $k$ $B$. The motivating example derive such is 5G wireless networks with multi-connectivity, where users their base stations. It important know how many a particular station serves, gives that station. To obtain these distributions, investigate distribution area si...