Unmanned Aerial Vehicle in the Logistics of Pandemic Vaccination: An Exact Analytical Approach for Any Number of Vaccination Centres

. 2022 Oct 20;10(10):2102. doi: 10.3390/healthcare10102102

(i) For odd n
Domain	Corresponding graph
$D_{1}$ ( $\frac{1}{n} < \frac{d}{C} \leq \frac{1}{n - 1})$	G{n, N = 2, ( $n - 1$ ,1 $)$ }
$D_{2}$ ( $\frac{1}{n - 1} < \frac{d}{C} \leq \frac{1}{n - 2})$	G{n, N = 2, ( $n - 2$ ,2 $)$ }
$D_{3}$ ( $\frac{1}{n - 2} < \frac{d}{C} \leq \frac{1}{n - 3})$	G{n, N = 2, ( $n - 3$ ,3 $)$ }
$D_{\frac{n - 1}{2}}$ ( $\frac{1}{\frac{n + 3}{2}} < \frac{d}{C} \leq \frac{1}{\frac{n + 1}{2}})$	G{n, N = 2, ( $\frac{n + 1}{2}, \frac{n - 1}{2})$ }
(ii) For even n
Domain	Corresponding graph
${\bar{D}}_{1}$ ( $\frac{1}{n} < \frac{d}{C} \leq \frac{1}{n - 1})$	G{n, N = 2, ( $n - 1$ ,1 $)$ }
${\bar{D}}_{2}$ ( $\frac{1}{n - 1} < \frac{d}{C} \leq \frac{1}{n - 2})$	G{n, N = 2, ( $n - 2$ ,2 $)$ }
${\bar{D}}_{3}$ ( $\frac{1}{n - 2} < \frac{d}{C} \leq \frac{1}{n - 3})$	G{n, N = 2, ( $n - 3$ ,3 $)$ }
${\bar{D}}_{\frac{n}{2}}$ ( $\frac{1}{\frac{n}{2} + 1)} < \frac{d}{C} \leq \frac{1}{\frac{n}{2}})$	G{n, N = 2, ( $\frac{n}{2}, \frac{n}{2})$ }