Perfectly weighted graphs (Q5952380)

A perfectly weighted graph is a tree with integer weights \(n_1,\dots,n_k\geq 2\) on the vertices such that its dual intersection matrix (the diagonal matrix with entries \(n_1,\dots,n_k\) minus the adjacency matrix) is positive definite with determinant equal to 1. A tree is called perfectible if there are weights which make it a perfect graph. It turns out that a tree is perfectible if an associated Diophantine equation has a solution. Perfectible trees arise in the study of perfect singular points of projective algebraic varieties; see \textit{L. Brenton} and \textit{D. Drucker} [Tôhoku Math. J., II. Ser. 41, 507-525 (1989; Zbl 0689.14015)]. In the present paper, a complete list of minimal perfectible ``barbell'' graphs is given, which were found via intensive computer searches for solutions of the relevant Diophantine equations. This continues (and almost completes) the classification of perfectible graphs, begun in \textit{L. Brenton} and \textit{R. Hill} [Pac. Math. J. 133, 41-67 (1988; Zbl 0616.14032)] and in \textit{W. Butske}, \textit{L. Jaje} and \textit{D. R. Mayernik} [Math. Comput. 69, 407-520 (2000; Zbl 0934.11015)].