Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
From MaRDI portal
Publication:2180715
DOI10.1016/j.amc.2020.125279zbMath1460.05120OpenAlexW3016853222MaRDI QIDQ2180715
Publication date: 14 May 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125279
Related Items (4)
Some families of integral mixed graphs ⋮ On -gain graphs with few positive eigenvalues ⋮ On the inertia index of a mixed graph in terms of the matching number ⋮ Spectral determination of graphs with one positive anti-adjacency eigenvalue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Mixed graphs with \(H\)-rank 3
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Developments on spectral characterizations of graphs
- Biclique decompositions and Hermitian rank
- Inertia and biclique decompositions of joins of graphs
- Which graphs are determined by their spectrum?
- Signed graphs with cut points whose positive inertia indexes are two
- On the relation between the positive inertia index and negative inertia index of weighted graphs
- Relations between the inertia indices of a mixed graph and those 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
- Signed graphs with small positive index of inertia
- Matrix Analysis
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- The relation between the H-rank of a mixed graph and the independence number of its underlying graph
- Characterization of graphs with exactly two non-negative eigenvalues
- On the inertia index of a mixed graph in terms of the matching number
This page was built for publication: Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra