Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs

DOI10.1016/J.LAA.2024.10.016MaRDI QIDQ6640934

Nathaniel Johnston, Sarah Plosker

Publication date: 20 November 2024

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

zbMATH Keywords

Hadamard matriceseigenspacesLaplacian integral graphsHadamard diagonalizable graphs

Mathematics Subject Classification ID

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

Cites Work

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

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)