On graph Laplacian eigenvectors with components in \- 1, 0, 1 \

DOI10.1016/J.DAM.2018.12.030MaRDI QIDQ2328100zbMATH OpenOpenAlexFDO

Authors Jean-Guy Caputo, I. Khames, Arnaud Knippel

Publication date 9 October 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.00072

zbMATH Keywords

graph eigenvectorsgraph Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+ 1}. Graphs having eigenvectors with components in {-1,+1} 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 {-1,0,+ 1} 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 some transformations.

Review text

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.

Recommendations

• Some properties of Laplacian eigenvectors
• Laplacian graph eigenvectors
• On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)
• Graphs whose normalized Laplacian has three eigenvalues
• On graphs with three distinct signless Laplacian eigenvalues

Cites work

• An introduction to the theory of graph spectra
• scientific article; zbMATH DE number 2130679 (Why is no real title available?)
• Laplacian graph eigenvectors
• Laplacian matrices of graphs: A survey
• On trees with Laplacian eigenvalue one
• On trees with perfect matchings
• On ±1 eigenvectors of graphs
• Oscillations of networks: the role of soft nodes
• Periodic orbits in nonlinear wave equations on networks
• Spectral bounds for the clique and independence numbers of graphs

Cited in

(9)

• Spectra of chains connected to complete graphs
• On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
• On ±1 eigenvectors of graphs
• Invertibility of graph translation and support of Laplacian Fiedler vectors
• Some properties of Laplacian eigenvectors
• Localized solutions of nonlinear network wave equations
• Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs
• Weakly Hadamard diagonalizable graphs and quantum state transfer

This page was built for publication: On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328100)