On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
From MaRDI portal
Publication:4580054
Recommendations
- 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
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Mixed graphs with \(H\)-rank 3
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
- On the inertia index of a mixed graph in terms of the matching number
- On the mixed adjacency matrix of a mixed graph
- Relationship between the rank and the matching number of a graph
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
- Graph theory
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Mixed graphs with \(H\)-rank 3
- More on the minimum skew-rank of graphs
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the mixed adjacency matrix of a mixed graph
- 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
- Skew spectra of oriented bipartite graphs
- Skew spectra of oriented graphs
- Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube
- Skew-rank of an oriented graph in terms of matching number
- Some inequalities on the skew-spectral radii of oriented graphs
- The extremal graphs with respect to their nullity
- The skew-rank of oriented graphs
- The spectral distribution of random mixed graphs
Cited in
(38)- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Relation between the trace norm of an oriented graph and its rank
- 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
- Proof of a conjecture on the nullity of a graph
- Developments on the Hoffman program of graphs
- Relation between the H-rank of a mixed graph and the girth of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Incidence matrices and line graphs of mixed graphs
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
- On the inertia index of a mixed graph in terms of the matching number
- Bounds of nullity for complex unit gain graphs
- Inverse of Hermitian adjacency matrix of mixed bipartite graphs
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- Relationship between the rank and the matching number of a graph
- 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
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- Relation between the rank of a signed graph and the rank of its underlying graph
- Inertia indices of a complex unit gain graph in terms of matching number
- A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- An improved lower bound for the nullity of a graph in terms of matching number
- On the characterization of digraphs with given rank
- Mixed graphs with \(H\)-rank 3
This page was built for publication: On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580054)
