Laplacian \-1,0,1\- and \-1,1\-diagonalizable graphs

DOI10.1016/J.LAA.2024.10.016MaRDI QIDQ6640934zbMATH OpenFDO

Authors Nathaniel Johnston, Sarah Plosker

Publication date 20 November 2024

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

zbMATH Keywords

eigenspacesHadamard matricesLaplacian integral graphsHadamard diagonalizable graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On Hadamard diagonalizable graphs
• Hadamard diagonalizable graphs of order at most 36
• Weakly Hadamard diagonalizable graphs
• The Laplacian polynomial of complete multipartite graphs
• On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)

Cites work

• scientific article; zbMATH DE number 4111676 (Why is no real title available?)
• scientific article; zbMATH DE number 1391684 (Why is no real title available?)
• Complex Hadamard diagonalisable graphs
• Constructably Laplacian integral graphs
• Hadamard diagonalizable graphs of order at most 36
• Indecomposable Laplacian integral graphs
• Laplacian graph eigenvectors
• On Hadamard diagonalizable graphs
• On certain eigenspaces of cographs
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Perfect state transfer in Laplacian quantum walk
• The Laplacian Spectrum of a Graph II
• The Laplacian polynomial of complete multipartite graphs
• The Rank of Circulant Matrices
• Van Lier sequences
• Weakly Hadamard diagonalizable graphs
• \(\{-1,0,1\}\)-basis for the null space of a forest

This page was built for publication: Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs

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