The largest Laplacian H-eigenvalue characterization of hyperstars

Let k3k\geq 3 be odd and let G=(V,E)G=(V,E) be a kk-uniform connected hypergraph whose maximum degree is d>0d>0. Let L\mathcal L be the Laplacian tensor of GG.

Hyperstar characterization conjecture. The largest Laplacian H-eigenvalue λ(L)\lambda(\mathcal L) is equal to dd if and only if GG 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.