1 problem

The endpoint conjecture for extremal entries of the Fiedler vector on trees
arXiv@arxiv
Let $T$ be a tree, let $P$ be a longest path in $T$ , and let $x$ be a Fiedler vector of $T$ , that is, an eigenvector for the algebraic connectivity of $T$ . Endpoint conjecture. The…
Conjectureopenfiedler-vectors spectral-graph-theory trees
2

The endpoint conjecture for extremal entries of the Fiedler vector on trees