Nordhaus-Gaddum type inequality for the fractional matching number of a graph

DOI10.1016/j.dam.2022.01.004zbMath1483.05134arXiv2105.13707OpenAlexW3173134574MaRDI QIDQ2078840

Ting Yang, Xi-Ying Yuan

Publication date: 4 March 2022

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

Full work available at URL: https://arxiv.org/abs/2105.13707

zbMATH Keywords

fractional matching numberfractional Berge's theoremNordhaus-Gaddum type inequality

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• Nordhaus-Gaddum-type relations of three graph coloring parameters
• The difference and ratio of the fractional matching number and the matching number of graphs
• On complementary graphs with no isolated vertices
• A note on Nordhaus-Gaddum inequalities for domination.
• Nordhaus-Gaddum type result for the matching number of a graph
• Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts
• A survey of Nordhaus-Gaddum type relations
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• On Complementary Graphs
• Some nordhaus‐‐ gaddum‐type results
• Unnamed Item
• Unnamed Item
• Unnamed Item