Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound (Q6602332)
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: Algorithmic aspects of \P_k\-isolation in graphs and extremal graphs for a \Pā\-isolation bound |
scientific article; zbMATH DE number 7910949
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound |
scientific article; zbMATH DE number 7910949 |
Statements
Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound (English)
0 references
11 September 2024
0 references
domination
0 references
\(\mathcal{F}\)-isolation number
0 references
extremal graphs
0 references
NP-completeness
0 references
0.8599900603294373
0 references
0.8411634564399719
0 references
0.8404051661491394
0 references
0.8322701454162598
0 references
0.8283310532569885
0 references
