Bounds for the rank of a complex unit gain graph in terms of the independence number

DOI10.1080/03081087.2020.1761768zbMath1487.05162arXiv1909.08533MaRDI QIDQ5073035

Ai-Mei Yu, Shengjie He, Rong-xia Hao

Publication date: 5 May 2022

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

Full work available at URL: https://arxiv.org/abs/1909.08533

zbMATH Keywords

independence number; rank; cyclomatic number; complex unit gain graph

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Unnamed Item, Inertia indices of a complex unit gain graph in terms of matching number

Cites Work

• Unnamed Item
• 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
• 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
• Signed graphs with cut points whose positive inertia indexes are two
• A note on the nullity of unicyclic signed 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
• 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 Laplacian Eigenvalues of Signed Graphs
• The relation between the H-rank of a mixed graph and the independence number of its underlying graph
• On the nullity of line graphs of trees
• On the independence number of a graph in terms of order and size
• Skew-rank of an oriented graph in terms of matching number