Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph

DOI10.1016/j.dam.2023.06.024zbMath1521.05153MaRDI QIDQ6094709

Qian-Qian Chen, Ji-Ming Guo

Publication date: 14 September 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Nordhaus-Gaddum type inequalityinteger \(k\)-matching number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other analytical inequalities (26D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On complementary graphs with no isolated vertices
• Nordhaus-Gaddum type result for the matching number of a graph
• Integer \(k\)-matchings of graphs
• A survey of Nordhaus-Gaddum type relations
• Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
• Nordhaus-Gaddum type inequality for the fractional matching number of a graph
• On perfect \(k\)-matchings
• On Complementary Graphs
• The fractional matching numbers of graphs

This page was built for publication: Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph