The largest Laplacian H-eigenvalue characterization of hyperstars
The largest Laplacian H-eigenvalue characterization of hyperstars
Let be odd and let be a -uniform connected hypergraph whose maximum degree is . Let be the Laplacian tensor of .
Hyperstar characterization conjecture. The largest Laplacian H-eigenvalue is equal to if and only if is a hyperstar.
For odd uniformity, the maximum degree is a tight lower bound for the largest Laplacian H-eigenvalue. The conjecture asserts that equality occurs exactly for hyperstars; the supplied text gives no evidence that this characterization has been resolved.
Sources & referencesView supporting material
Primary source
Shenglong Hu, Liqun Qi and Jinshan Xie, “The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph”, arXiv:1304.1315 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.