Introducing 3-path domination in graphs (Q6586650)
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 7896127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Introducing 3-path domination in graphs |
scientific article; zbMATH DE number 7896127 |
Statements
Introducing 3-path domination in graphs (English)
0 references
13 August 2024
0 references
dominating set
0 references
3-path
0 references
NP-completeness
0 references
0.8106924891471863
0 references
0.7999235391616821
0 references
0.7996969223022461
0 references
0.7995075583457947
0 references
