Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph (Q6094709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7737605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph |
scientific article; zbMATH DE number 7737605 |
Statements
Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph (English)
0 references
14 September 2023
0 references
integer \(k\)-matching number
0 references
Nordhaus-Gaddum type inequality
0 references
0 references
0.95639735
0 references
0.9544172
0 references
0 references
0 references
0.89614236
0 references
0.89367133
0 references
0.8925578
0 references
0.8899585
0 references
