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

DOI10.1080/03081087.2018.1488936MaRDI QIDQ5235773zbMATH OpenOpenAlexFDO

Authors Shuchao Li, Si-Qi Zhang, Baogen 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

\(H\)-rankindependence numbermixed graph

Mathematics Subject Classification ID

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

Recommendations

• Relation between the \(H\)-rank of a mixed graph and 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 on the nullity, the H-rank and the Hermitian energy of a mixed graph
• Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
• Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph

Cites work

• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
• Graph theory
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Introduction to algorithms.
• Mixed graphs with \(H\)-rank 3
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On the mixed adjacency matrix of a mixed 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
• 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
• The spectral distribution of random mixed graphs

Cited in

(14)

• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• 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
• The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
• Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
• 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
• Incidence matrices and line graphs of mixed graphs
• Characterization of graphs with rank 2v(G) - 2(G) - 2c(G) + 1
• Relation between the H-rank of a mixed graph and the girth of its underlying graph
• Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235773)