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

DOI10.1007/S10878-021-00704-6MaRDI QIDQ2025060zbMATH OpenOpenAlexFDO

Authors Jinling Yang, Ligong 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

\(H\)-rankmixed bipartite graphswitching equivalence

Mathematics Subject Classification ID

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

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
• Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• Mixed graphs with \(H\)-rank 3

Cites work

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

Cited in

(8)

• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
• Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
• Mixed graphs with \(H\)-rank 3
• Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
• 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
• Characterizing line graphs of triangle-free mixed graphs

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

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