On mixed graphs whose Hermitian spectral radii are at most 2

DOI10.1007/s00373-020-02181-wzbMath1458.05161arXiv1910.03167OpenAlexW3026264078MaRDI QIDQ2227996

Shi-Cai Gong, Yun Qiao, Yi Wang, Bo-Jun Yuan

Publication date: 16 February 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

mixed graph\(C_4\)-free graphHermitian spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \), Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\), Quantum state transfer on integral oriented circulant graphs, Incidence matrices and line graphs of mixed graphs, Characterizing signed mixed graphs with small eigenvalues, Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\), Maximal digraphs whose Hermitian spectral radius is at most 2, Hermitian adjacency matrix of the second kind for mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some inequalities on the skew-spectral radii of oriented graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• The spectral distribution of random mixed graphs
• Mixed graphs with \(H\)-rank 3
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• Interlacing families and the Hermitian spectral norm of digraphs
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• Cyclotomic matrices over the Eisenstein and Gaussian integers
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• On oriented graphs whose skew spectral radii do not exceed 2
• Large regular bipartite graphs with median eigenvalue 1
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• 3-regular mixed graphs with optimum Hermitian energy