On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\) (Q2328100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7114961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\) |
scientific article; zbMATH DE number 7114961 |
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
0.7723168134689331
0 references
0.7690678238868713
0 references
0.767602801322937
0 references
0.7595062851905823
0 references
0.7568106055259705
0 references
