The fractional (strong) matching preclusion number of complete \(k\)-partite graph (Q2238215)
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 7417745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The fractional (strong) matching preclusion number of complete \(k\)-partite graph |
scientific article; zbMATH DE number 7417745 |
Statements
The fractional (strong) matching preclusion number of complete \(k\)-partite graph (English)
0 references
1 November 2021
0 references
fractional (strong) matching preclusion number
0 references
complete \(k\)-partite graph
0 references
0 references
0 references
0 references
0 references
0 references
0.9526294469833374
0 references
0.8865908980369568
0 references
0.8572679162025452
0 references
0.8517621159553528
0 references
0.8371883630752563
0 references
