Sharp lower bound on the "number of nodal decomposition" of graphs

Hiranya Kishore Dey, Soumyajit Saha

Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the…