On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
From MaRDI portal
Publication:5080252
DOI10.1080/03081087.2020.1776205zbMath1490.05126OpenAlexW3035683969MaRDI QIDQ5080252
Publication date: 31 May 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2020.1776205
Related Items (4)
Inertia indices of a complex unit gain graph in terms of matching number ⋮ Characterizing signed mixed graphs with small eigenvalues ⋮ Unnamed Item ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
Cites Work
- Unnamed Item
- Spectral properties of complex unit gain graphs
- 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
- Oriented gain graphs, line graphs and eigenvalues
- Biased graphs. I: Bias, balance, and gains
- A mathematical bibliography of signed and gain graphs and allied areas
- Glossary of signed and gain graphs and allied areas
- Inertia of complex unit gain graphs
- 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
- Adjacency rank and independence number of a signed graph
- Complex unit gain bicyclic graphs with rank 2, 3 or 4
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
- On the relation between theH-rank 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
- Relation between the rank of a signed graph and the rank of its underlying graph
- 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
- The extremal graphs with respect to their nullity
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
