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

DOI10.1016/J.LAA.2024.10.016MaRDI QIDQ6640934FDOQ6640934

Authors: Nathaniel Johnston, Sarah Plosker 

Publication date: 20 November 2024

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

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 \}\)

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)

Cites Work

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

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)