On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph

Recommendations

The rank of a complex unit gain graph in terms of the matching number
The rank of a complex unit gain graph in terms of the rank of its underlying graph
Bounds for the rank of a complex unit gain graph in terms of the independence number
Inertia indices of a complex unit gain graph in terms of matching number
Bounds for the rank of a complex unit gain graph in terms of its maximum degree

Cites work

A mathematical bibliography of signed and gain graphs and allied areas
Adjacency rank and independence number of a signed graph
Biased graphs. I: Bias, balance, and gains
Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
Complex unit gain bicyclic graphs with rank 2, 3 or 4
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
Glossary of signed and gain graphs and allied areas
scientific article; zbMATH DE number 740754 (Why is no real title available?)
Inertia of complex unit gain graphs
On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
On the determinant of the Laplacian matrix of a complex unit gain 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
Oriented gain graphs, line graphs and eigenvalues
Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
Relation between the rank of a signed 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
Relation between the skew-rank of an oriented graph and the rank of its underlying graph
Skew-rank of an oriented graph in terms of matching number
Spectral properties of complex unit gain graphs
The extremal graphs with respect to their nullity
The rank of a complex unit gain graph in terms of the rank of its underlying graph
The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph

Cited in

(15)

Relationship between the rank and the matching number of a graph
The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
The rank of a complex unit gain graph in terms of the matching number
The rank of a complex unit gain graph in terms of the rank of its underlying graph
On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
Bounds for the rank of a complex unit gain graph in terms of the independence number
On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
scientific article; zbMATH DE number 7692350 (Why is no real title available?)
Inertia indices of a complex unit gain graph in terms of matching number
Characterizing signed mixed graphs with small eigenvalues
The gap between the rank of a complex unit gain graph and its underlying graph
Bounds of nullity for complex unit gain graphs
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
Dual quaternion matrices in precise formation flying of satellite clusters
The left row rank of quaternion unit gain graphs in terms of girth

This page was built for publication: On the relation between the adjacency rank of a complex unit gain 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 Q5080252)