Relationship between the rank and the matching number of a graph

DOI10.1016/J.AMC.2019.02.055MaRDI QIDQ2011117zbMATH OpenOpenAlexWikidataFDO

Authors Zhimin Feng, Jing Huang, Shuchao Li, Xiao-Bing Luo

Publication date 28 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.02.055

zbMATH Keywords

matching numbernullityrank

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• The rank of a signed graph
• On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph

Cites work

• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• A characterization of graphs with rank 4
• A characterization of graphs with rank 5
• A note on the nullity of unicyclic graphs
• An upper bound for the nullity of a bipartite graph in terms of its maximum degree
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• Chromatic number and the 2-rank of a graph
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On the maximal nullity of unicyclic graphs with fixed girth
• On the nullity and the matching number of unicyclic graphs
• On the nullity of a graph with cut-points
• On the nullity of bicyclic graphs
• On the nullity of bipartite graphs
• On the nullity of connected graphs with least eigenvalue at least -2
• On the nullity of graphs
• On the nullity of graphs with pendant trees
• On the nullity of graphs with pendent vertices
• On the nullity of tricyclic graphs
• On the rank of multicyclic graphs
• 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
• Skew-rank of an oriented graph with edge-disjoint cycles
• The extremal graphs with respect to their nullity
• The nullity of 2-connected tricyclic graphs
• The nullity of (k-1)-cyclic graphs
• The nullity of \(k\)-cyclic graphs of \(\infty\)-type
• The rank of a graph after vertex addition
• The rank of a signed graph in terms of the rank of its underlying graph
• The skew-rank of oriented graphs
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system

Cited in

(15)

• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• Some mixed graphs with \(H\)-rank 4, 6 or 8
• Relations between the inertia indices of a mixed graph and those of its underlying graph
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• scientific article; zbMATH DE number 4210179 (Why is no real title available?)
• 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
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• scientific article; zbMATH DE number 7692350 (Why is no real title available?)
• The gap between the rank of a complex unit gain graph and its underlying graph
• Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
• Some relations between rank of a graph and its complement

Describes a project that uses

Uses Software

• AutoGraphiX

This page was built for publication: Relationship between the rank and the matching number of a graph

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