Some mixed graphs with \(H\)-rank 4, 6 or 8

DOI10.1007/s10878-021-00704-6zbMath1464.05256OpenAlexW3129155564MaRDI QIDQ2025060

Jinling Yang, Li-Gong Wang, Xiuwen Yang

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00704-6

zbMATH Keywords

switching equivalence\(H\)-rankmixed bipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Combinatorial necessary conditions for regular graphs to induce periodic quantum walks ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

Cites Work

• Unnamed Item
• Bicyclic oriented graphs with skew-rank 2 or 4
• A characterization of graphs with rank 5
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Mixed graphs with \(H\)-rank 3
• A characterization of graphs with rank 4
• Bicyclic oriented graphs with skew-rank 6
• 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
• Spektren endlicher Grafen
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• 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
• Relationship between the rank and the matching number of a graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• Skew-rank of an oriented graph and independence number of its underlying graph
• 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
• The minimum rank of matrices and the equivalence class graph
• A characterization of singular graphs
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Graphs and matrices

This page was built for publication: Some mixed graphs with \(H\)-rank 4, 6 or 8