Interlacing families and the Hermitian spectral norm of digraphs

DOI10.1016/j.laa.2018.12.004zbMath1405.05069arXiv1602.06274OpenAlexW2285909053MaRDI QIDQ1715844

Erdal Karapınar

Publication date: 29 January 2019

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

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

zbMATH Keywords

digraphspectral radiusuniversal covermatching polynomialHermitian adjacency matrixinterlacing families

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On extremal spectral results of digraphs based on sum distance ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ On mixed graphs whose Hermitian spectral radii are at most 2 ⋮ On the largest eigenvalue of a mixed graph with partial orientation ⋮ The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum

Cites Work

• Unnamed Item
• Skew-adjacency matrices of graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• The spectrum of an infinite graph
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Large regular bipartite graphs with median eigenvalue 1
• Quasi-Random Oriented Graphs
• Quasi-random tournaments
• Expander graphs and their applications
• A Survey on Spectra of infinite Graphs
• Matchings and walks in graphs

This page was built for publication: Interlacing families and the Hermitian spectral norm of digraphs