Minimizing the number of edges in (<i>P</i><sub><i>k</i></sub> ∪ <i>K</i><sub>3</sub>)-saturated connected graphs (Q6041212)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs |
scientific article; zbMATH DE number 7689330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of edges in (<i>P</i><sub><i>k</i></sub> ∪ <i>K</i><sub>3</sub>)-saturated connected graphs |
scientific article; zbMATH DE number 7689330 |
Statements
Minimizing the number of edges in (<i>P</i><sub><i>k</i></sub> ∪ <i>K</i><sub>3</sub>)-saturated connected graphs (English)
0 references
26 May 2023
0 references
graph saturation
0 references
saturation number
0 references
cyclomatic number
0 references
0.8395118117332458
0 references
0.8304300904273987
0 references
0.8233125805854797
0 references
0.8205008506774902
0 references
