Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
From MaRDI portal
Recommendations
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
Cited in
(13)- Biclique decompositions and Hermitian rank
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- On the largest eigenvalue of a mixed graph with partial orientation
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- The rank of a complex unit gain graph in terms of the matching number
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Nullity of Hermitian-adjacency matrices of mixed graphs
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Mixed graphs with \(H\)-rank 3
This page was built for publication: Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568165)
