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
Recommendations
- On the inertia index of a mixed graph in terms of the matching number
- Hermitian Laplacian matrix and positive of mixed graphs
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Mixed paths and cycles determined by their spectrum
- On mixed graphs whose Hermitian spectral radii are at most 2
Cites work
- Biclique decompositions and Hermitian rank
- Characterization of graphs with exactly two non-negative eigenvalues
- Developments on spectral characterizations of graphs
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 3580591 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3214390 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Inertia and biclique decompositions of joins of graphs
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- Matrix Analysis
- Mixed graphs with \(H\)-rank 3
- Nullity of Hermitian-adjacency matrices of mixed graphs
- On the inertia index of a mixed graph in terms of the matching number
- 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
- Signed graphs with cut points whose positive inertia indexes are two
- Signed graphs with small positive index of inertia
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Which graphs are determined by their spectrum?
Cited in
(6)- Spectral determination of graphs with one positive anti-adjacency eigenvalue
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- 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
- Hermitian Laplacian matrix and positive of mixed graphs
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180715)