18 problems

Let $G$ be a finite simple connected graph of order $n=|V(G)|\ge2$. For each vertex $v$, let $d(v)$ be its degree and $N(v)$ its open neighbourhood, and define … Let $D(G)$ be the…

Triangle inequality conjecture. For any pure states $\textup{\textbf{x}},\textup{\textbf{y}},\textup{\textbf{z}}\in\mathbb{P}(\mathbb{C}^n)$,

Let $G$ be an interval graph. A graph is called BDM-constructible if it is uniquely determined by its boundary distance matrix (with the relevant order and boundary fixed). Interva…

Let $G$ and $H$ be graphs, and suppose that a single similarity matrix establishes cospectrality of their generalized distance matrices for two distinct values of $q$, neither of w…

Coefficient formula conjecture. The coefficient of $x^{2n-5}$ is

Let $G_1$ and $G_2$ be graphs with $B_1\subseteq V(G_1)$ and $B_2\subseteq V(G_2)$. Coalescing conjecture. If coalescing the same connected rooted graph onto every vertex of $B_1$…

Let $D_k(T)$ denote the Steiner distance hypermatrix of order $k$ associated with a tree $T$ on $n$ vertices. Steiner distance Graham–Pollak determinant conjecture. The quantity…

Let $G$ be a connected graph of order $n\geq 4$, with remoteness $\rho$, and suppose that $G\ncong K_n$ and $G\ncong K_n-e$. Here $K_n-e$ is the complete graph with one edge remove…

Let $H_1$ and $H_2$ be graphs, and let $B_1\subseteq V(H_1)$ and $B_2\subseteq V(H_2)$ be vertex sets. Let $\mathcal{D}$ denote the distance matrix, whose $(u,v)$-entry records the…

Let $G$ be a connected graph on $n\geq 4$ vertices with diameter $D$, proximity $\pi$ and distance spectrum $\partial_1\geq \ldots \geq \partial_n$. Auchiche–Hansen's conjecture. ……

Let $T$ be a tree with $n\geq 3$ vertices. Let $d_k(T)$ denote the normalized coefficients of the distance characteristic polynomial, defined from the coefficients $\delta_k(T)$ by…

Let $T$ be a tree of order $n\geq 3$. For a graph $G$ of order $n$, write $\delta_k(G)$ for the coefficients of its distance characteristic polynomial and define the normalized coe…

Let a level-$2$ network be a network whose blobs have level at most $2$, let a macaron be a level-$2$ blob with two cut-edges, and let an alt-path structure be the structure descri…

Let $G$ be a connected non-transmission-regular graph with $n$ vertices. Its distance spectral radius $\lambda_1(G)$ is the largest eigenvalue of its distance matrix, and…

Let $n,k$ be positive integers, let $0<\alpha<1$, and let $G\in\mathcal{G}_{n,k}$. Here, $\mu_\alpha(G)$ denotes the generalized distance spectral radius of $G$, and $K(n,k,1)$ is…

Let $\mathbf{d}$ be a tree degree sequence, and let $BFS(\mathbf{d})$ denote its breadth-first-search (greedy) tree. For a graph $G$, let $RD(G)$ be its terminal distance matrix, a…

Let a tree degree sequence be fixed, and let $BFS(\mathbf{d})$ denote the breadth-first-search (greedy) tree generated by it. The BFS-tree conjecture for distance spectral radius.…

Let $A_k=(a_{ij})$ be the $k\times k$ matrix with $a_{ij}=\frac{1}{2}|i-j|$, and let $I_k$ be the $k\times k$ identity matrix. Define $C_k(\lambda)=\det(A_k-\lambda I_k)$ to be the…