20 problems

Laplacian spread conjecture. For any graph $G$ of order $n\geq 2$,

Maximum-connectivity–girth conjecture. For fixed degree $d$ and order $n$, a graph maximizing $AC(G)$ also has maximum possible girth.

Fix a surface $S$, and let $\mathcal{A}^{\infty}(S)$ denote the asymptotic algebraic connectivity associated with graphs on $S$. The double wheel graph is a graph whose algebraic c…

Let $G$ be a planar bichromatic graph, meaning a planar graph whose vertices can be coloured with two colours so that adjacent vertices have different colours. Let $a(G)$ denote it…

Let $G$ be a planar graph, and let $a(G)$ denote its algebraic connectivity, the second-smallest eigenvalue of its Laplacian. The graphs $K_4$ and $2K_1\dot{+}C_4$ are the complete…

Kolokolnikov's conjecture. The algebraic connectivity of $G$ is at most

Extremal algebraic-connectivity conjecture. Given fixed $n\geq k+1$ and $k\geq 2$, the unique $k$-path graph that maximizes the algebraic connectivity is $K_{k-1}\vee P_{n-k+1}$. M…

Let $a(G,X)$ denote the algebraic connectivity of a graph $G$ in a normed space $X$, let $K_{2d}$ be the complete graph on $2d$ vertices, and let $T_d$ be the tree defined in the p…

K{3,3} algebraic-connectivity conjecture. Based on computer experiments, the lower bound proved earlier in the paper is conjectured to be tight, namely

Algebraic-connectivity monotonicity conjecture. The function $f(g;d,n)$ is increasing as a function of $g$.

Let $G$ be a graph with a given girth. The lollipop graph is the graph formed by joining a cycle to a path at one common endpoint. Fallat–Kirkland's lollipop graph conjecture. The…

For $d\geq 1$, let the maximum range over all $2d$-regular graphs $G$ on $n$ vertices be taken. Regular-graph vanishing conjecture. … This is presented as a possible generalization…

Let $a_d(K_n)$ denote the parameter associated with $d$-dimensional algebraic connectivity for the complete graph $K_n$. Complete-graph tightness conjecture. If $n\geq 2d$, then ……

For each $n\ge 11$, let $\mathcal{G}_n$ be the quartic graph of order $n$ constructed from the blocks displayed in the paper, and call a quartic graph minimal when it has minimum s…

Quartic minimum-gap conjecture. The connected quartic graph on $n\geq 11$ vertices with minimum spectral gap is the unique graph $G$ described as follows: $G$ consists of $q$ middl…

Let $G$ be a cubic graph, and let $D$ be its diameter. The cubic-graph algebraic-connectivity bound conjecture. Its algebraic connectivity satisfies … Moreover, if $G$ has order…

Let $T$ be a tree with … vertices and maximum degree $d$. The well-balanced Bethe tree extremal conjecture. Its algebraic connectivity is less than the algebraic connectivity of th…

Let $T$ be a tree with $n$ vertices and maximum degree $d$. The asymptotically optimal tree bound conjecture. As $n\rightarrow\infty$ for fixed $d$, … Here $\lambda_{2}(T)$ denotes…

Let $G$ be a graph with exactly $n$ vertices and $m=2(n-2)$ edges. The complete-bipartite extremal conjecture. Among all such graphs, a graph maximizing the algebraic connectivity…

Let $G$ be a connected graph distinct from the complete graph $K_n$, where $n$ is the number of vertices, and let $[?]$ denote algebraic connectivity. An $(n,p,t)$-path-complete gr…