On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \-1,+1\

DOI10.1016/J.LAA.2020.05.006MaRDI QIDQ2229491zbMATH OpenOpenAlexFDO

Authors Jorge Alencar, Leonardo Silva de Lima

Publication date 17 February 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

adjacency matrixeigenvectorexact graphsignless Laplacian matrixWilf's problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: Let $G$ be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by $pm1$? In this paper, we answer this question for the adjacency, Laplacian and signless Laplacian matrix of a graph. Besides, we generalize the concept of an exact graph to the adjacency and signless Laplacian matrices. Infinity families of exact graphs for all those matrices are presented.

Recommendations

• On ±1 eigenvectors of graphs
• scientific article; zbMATH DE number 7365978
• On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)

Cites work

• Commutativity and spectra of Hermitian matrices
• scientific article; zbMATH DE number 2157459 (Why is no real title available?)
• scientific article; zbMATH DE number 4193718 (Why is no real title available?)
• Laplacian eigenvalues and the maximum cut problem
• On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
• On ±1 eigenvectors of graphs
• Properties of spectra of graphs and line graphs
• Spectral bounds for the clique and independence numbers of graphs
• The smallest eigenvalue of the signless Laplacian

Cited in

(5)

• On a question of Haemers regarding vectors in the nullspace of Seidel matrices
• On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
• A Laplacian eigenbasis for threshold graphs

This page was built for publication: On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)

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