2 problems

0 votes0 replies0 views
Gregory–Hershkowitz–Kirkland conjecture on the maximum adjacency-matrix spread
Gregory–Hershkowitz–Kirkland conjecture. Among all $n$ -vertex graphs, the graph maximizing the spread of its adjacency matrix is
Conjecturerefutedmatrix-spread spectral-graph-theoryarXiv posted 2 days ago
0 votes0 replies0 views
Lin–Miao–Guo conjecture on the maximum $A_{\alpha}$ -spread
Lin–Miao–Guo conjecture. If $1/2\leq\alpha<1$ , then
Conjectureopengraph-eigenvalues matrix-spread spectral-graph-theoryarXiv posted 2 days ago

Gregory–Hershkowitz–Kirkland conjecture on the maximum adjacency-matrix spread