Nordhaus-Gaddum type result for the matching number of a graph
From MaRDI portal
Publication:1680497
DOI10.1007/s10878-017-0120-6zbMath1378.05169OpenAlexW2610126445MaRDI QIDQ1680497
Huiqiu Lin, Baoyindureng Wu, Jin-Long Shu
Publication date: 16 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0120-6
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)
Related Items
Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph, Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph, Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings, Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph, Nordhaus-Gaddum type inequality for the fractional matching number of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
- Nordhaus-Gaddum-type relations of three graph coloring parameters
- On complementary graphs with no isolated vertices
- A note on Nordhaus-Gaddum inequalities for domination.
- 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
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts