The rank of a complex unit gain graph in terms of the matching number
From MaRDI portal
Publication:2174475
DOI10.1016/j.laa.2019.12.014zbMath1437.05141arXiv1909.07555OpenAlexW2996708410WikidataQ126579599 ScholiaQ126579599MaRDI QIDQ2174475
Shengjie He, Fengming Dong, Rong-xia Hao
Publication date: 21 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.07555
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)
Related Items (11)
On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ Inertia indices of a complex unit gain graph in terms of matching number ⋮ NEPS of complex unit gain graphs ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ Complex unit gain graphs with exactly one positive eigenvalue ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree ⋮ Bounds for the energy of a complex unit gain graph ⋮ Spectra of quaternion unit gain graphs ⋮ Unnamed Item ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Spectral properties of complex unit gain graphs
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- The rank of a graph after vertex addition
- Inertia of complex unit gain graphs
- 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
- Large regular bipartite graphs with median eigenvalue 1
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the nullity of line graphs of trees
- 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: The rank of a complex unit gain graph in terms of the matching number
