Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
From MaRDI portal
Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
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.
Cites work
- 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
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Bicyclic digraphs with extremal skew energy
- Bicyclic oriented graphs with skew-rank 2 or 4
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Characterization of sub-long graphs of arbitrary rank
- Dependence of graph energy on nullity: a case study
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Lower bounds of graph energy in terms of matching number
- Mixed graphs with \(H\)-rank 3
- Nullity of a graph with a cut-edge
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- On the independence number of a graph in terms of order and size
- On the mixed adjacency matrix of a mixed graph
- On the nullity number of graphs
- On the rank of a real skew symmetric matrix described by an oriented graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Relation between the skew energy of an oriented graph and its matching number
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Relationship between the rank and the matching number of a graph
- Skew-rank of an oriented graph and independence number of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- The energy of graphs and matrices
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- The spectral distribution of random mixed graphs
- Upper bound of skew energy of an oriented graph in terms of its skew rank
Cited in
(12)- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- On the Hermitian-incidence energy of mixed graphs
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Mixed graphs with \(H\)-rank 3
- Inertia indices of a complex unit gain graph in terms of matching number
- Singular graphs with dicyclic or semi-dihedral group action
- The Hermitian Kirchhoff index and robustness of mixed graph
- Relation between the H-rank of a mixed graph and the girth of its underlying graph
- Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
- Characterizing line graphs of triangle-free mixed graphs
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)
