2 problems
Let be an ordinary graph, let be even, and let be the -power hypergraph of . Let and be the Laplacian and signl…
Hyperstar characterization conjecture. The largest Laplacian H-eigenvalue is equal to if and only if is a hyperstar.
Let be an ordinary graph, let be even, and let be the -power hypergraph of . Let and be the Laplacian and signl…
Hyperstar characterization conjecture. The largest Laplacian H-eigenvalue is equal to if and only if is a hyperstar.