5 problems

Let $G$ be a nonempty connected graph. Write $V(G)$ for its vertex set and $d_G$ for its geodesic distance. Let $\mathfrak{MB}$ denote the class of metric spaces $(X,d)$ such that…

Let $G$ be a distance-regular graph of diameter $d$ with eigenvalues $\theta_0>\theta_1>\cdots>\theta_d$. For the cosine sequence…

Let $G$ be a distance-regular graph with diameter $d$, with eigenvalues $\theta_0>\theta_1>\cdots>\theta_d$ and cosine sequences $(w_0(\theta_j),\ldots,w_d(\theta_j))$ correspondin…

Let $G$) be a distance-regular graph with diameter $d$, valency $k$, eigenvalues $\theta_0>\theta_1>ots>\theta_d$, and standard sequences $(w_0(\theta_j),...,w_d(\theta_j))$ corres…

Affine preferential attachment metric conjecture. The function $d_\delta$ is a metric on trees with at least $3$ vertices.