On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\) (Q2328100)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\) |
scientific article |
Statements
On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\) (English)
0 references
9 October 2019
0 references
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.
0 references
graph Laplacian
0 references
graph eigenvectors
0 references
