On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
From MaRDI portal
Publication:2273886
DOI10.1016/j.laa.2019.07.027zbMath1419.05107OpenAlexW2963458450MaRDI QIDQ2273886
Guangfu Wang, Si-Qi Zhang, Shuchao Li, Wei Wei
Publication date: 18 September 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.07.027
Related Items (3)
On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- The spectral distribution of random mixed graphs
- First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
- Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
- Mixed graphs with \(H\)-rank 3
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- Hermitian Laplacian matrix and positive of mixed 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
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Minimum rank of skew-symmetric matrices described by a graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- The rank of a signed graph in terms of the rank of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Relationship between the rank and the matching number of a graph
- The skew energy of a digraph
- Skew spectra of oriented graphs
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Large regular bipartite graphs with median eigenvalue 1
- On the Laplacian characteristic polynomials of mixed graphs
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the rank of a real skew symmetric matrix described by an oriented graph
- The Factorization of Linear Graphs
- On the mixed adjacency matrix of a mixed 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
- 3-regular mixed graphs with optimum Hermitian energy
This page was built for publication: On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs