On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\) (Q2328100): Difference between revisions

The authors characterize graphs that have a Laplacian eigenvector with either all components in \(\{-1,1\}\) (bivalent graphs) or all components in \(\{-1,0,1\}\) (trivalent graphs). Characterizations are constructive in the sense that all bivalent and trivalent graphs are made from the basic building blocks (regular bipartite graphs and soft regular tripartite graphs, respectively) by applying to them a few transformations that preserve these properties.