Mixed graphs with H-rank 3
From MaRDI portal
Publication:526283
DOI10.1016/J.LAA.2017.02.037zbMATH Open1361.05076OpenAlexW2593387735MaRDI QIDQ526283FDOQ526283
Yi Wang, Chong-Jun Wang, Shuangdong Li, Bo-Jun Yuan
Publication date: 10 May 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.02.037
Cites Work
- Title not available (Why is that?)
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- A characterization of graphs with rank 5
- A characterization of graphs with rank 4
- On the nullity of graphs
- Large regular bipartite graphs with median eigenvalue 1
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
Cited In (26)
- The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
- Relation between the trace norm of an oriented graph and its rank
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- Complex unit gain graphs of rank 2
- Spectral characterizations of tournaments
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- On -gain graphs with few positive eigenvalues
- On the inertia index of a mixed graph in terms of the matching number
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- On the characteristic polynomial and energy of Hermitian quasi-Laplacian matrix of mixed graphs
- Characterization of oriented graphs of rank 2
- On graphs whose orientations are determined by their Hermitian spectra
- On mixed graphs whose Hermitian spectral radii are at most 2
- Almost rank three graphs
- The relation between the H-rank of a mixed graph and the independence number of its underlying graph
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Hermitian adjacency matrix of the second kind for mixed graphs
- On the characterization of digraphs with given rank
This page was built for publication: Mixed graphs with \(H\)-rank 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526283)
