A new kind of Hermitian matrices for digraphs
DOI10.1016/j.laa.2019.09.024zbMath1426.05009arXiv1909.10878OpenAlexW2977164051WikidataQ114664027 ScholiaQ114664027MaRDI QIDQ2332441
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.10878
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Directed graphs (digraphs), tournaments (05C20)
Related Items (24)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Skew-adjacency matrices of graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Spectra of graphs
- Eigenvalues and colorings of digraphs
- On maximum-sized near-regular and \(\root 6\of{1}\)-matroids
- Obstacles to decomposition theorems for sixth-root-of-unity matroids
- Large regular bipartite graphs with median eigenvalue 1
- Matroids—the Engineers’ Revenge
- The Eigenvalues of a Graph and Its Chromatic Number
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
This page was built for publication: A new kind of Hermitian matrices for digraphs