Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number

DOI10.1016/J.DISC.2026.115119MaRDI QIDQ7231848zbMATH OpenFDO

Authors Qi Wu, Yong Lu

Publication date 22 April 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115119

zbMATH Keywords

\(H\)-rankfractional matchingmatching numbermixed graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• An improved lower bound for the nullity of a graph in terms of matching number
• An upper bound of the nullity of a graph in terms of order and maximum degree
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Bounds of nullity for complex unit gain graphs
• Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• Graph theory with applications
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• Mixed graphs with \(H\)-rank 3
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On connected graphs of order n with girth g and nullity n-g
• On the nullity and the matching number of unicyclic graphs
• On the nullity of graphs
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• Relation between the H-rank of a mixed graph and the girth of its underlying graph
• Relation between the nullity of a graph and its matching number
• Relationship between the rank and the matching number of a graph
• Skew-rank of an oriented graph in terms of matching number
• Some mixed graphs with \(H\)-rank 4, 6 or 8
• Spektren endlicher Grafen
• The nullity of a graph with fractional matching number
• The rank of a graph after vertex addition
• The rank of a signed graph
• The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph

This page was built for publication: Improved bounds on the \(H\)-rank of a mixed graph in terms of the matching number and fractional matching number

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