The relation between the H-rank of a mixed graph and the independence number of its underlying graph

DOI10.1080/03081087.2018.1488936zbMath1422.05064OpenAlexW2809860078MaRDI QIDQ5235773

Shuchao Li, Si-Qi Zhang, Bao-Gen Xu

Publication date: 14 October 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1488936

zbMATH Keywords

independence numbermixed graph\(H\)-rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ Relations between the inertia indices of a mixed graph and those of its underlying graph ⋮ Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra ⋮ Incidence matrices and line graphs of mixed graphs ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

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
• 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
• Mixed graphs with \(H\)-rank 3
• 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
• 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 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

This page was built for publication: The relation between the H-rank of a mixed graph and the independence number of its underlying graph