On graphs whose orientations are determined by their Hermitian spectra
From MaRDI portal
Publication:2200431
DOI10.37236/9640zbMath1448.05134OpenAlexW3109185645MaRDI QIDQ2200431
Publication date: 21 September 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9640
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}\) ⋮ Unnamed Item ⋮ Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- The spectral distribution of random mixed graphs
- Mixed graphs with \(H\)-rank 3
- Hermitian Laplacian matrix and positive of mixed graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Developments on spectral characterizations of graphs
- Cycles through specified vertices of a graph
- Which graphs are determined by their spectrum?
- 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
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Large regular bipartite graphs with median eigenvalue 1
- On cycle bases of a graph
- A Theorem on n-Coloring the Points of a Linear Graph
- 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
