Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
DOI10.1080/03081087.2019.1679702zbMATH Open1472.05104OpenAlexW2981095191MaRDI QIDQ4959321FDOQ4959321
Authors: Wei Wei, Shuchao Li, Hongping Ma
Publication date: 13 September 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1679702
Recommendations
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Cites Work
- The energy of graphs and matrices
- Title not available (Why is that?)
- On the independence number of a graph in terms of order and size
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Title not available (Why is that?)
- Bicyclic oriented graphs with skew-rank 2 or 4
- On the nullity number of graphs
- Title not available (Why is that?)
- 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
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
- The spectral distribution of random mixed graphs
- Mixed graphs with \(H\)-rank 3
- Skew-rank of an oriented graph in terms of matching number
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Title not available (Why is that?)
- On the mixed adjacency matrix of a mixed graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Relationship between the rank and the matching number of a graph
- 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
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Title not available (Why is that?)
- The relation between the H-rank of a mixed graph and the independence number of its underlying graph
- Lower bounds of graph energy in terms of matching number
- Relation between the skew energy of an oriented graph and its matching number
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- Skew-rank of an oriented graph and independence number of its underlying graph
- On the rank of a real skew symmetric matrix described by an oriented graph
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Characterization of sub-long graphs of arbitrary rank
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959321)