On graph Laplacian eigenvectors with components in {−1,0,1}

2019 
We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in or . Graphs having eigenvectors with components in are called bivalent and are shown to be the regular bipartite graphs and their extensions obtained by adding edges between vertices with the same value for the given eigenvector. Graphs with eigenvectors with components in are called trivalent and are shown to be soft-regular graphs – graphs such that vertices associated with non-zero components have the same degree – and their extensions via certain transformations.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []