Algorithmic aspects of total vertex-edge domination in graphs (Q6629669)
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 7935902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of total vertex-edge domination in graphs |
scientific article; zbMATH DE number 7935902 |
Statements
Algorithmic aspects of total vertex-edge domination in graphs (English)
0 references
30 October 2024
0 references
vertex-edge dominating set
0 references
total dominating set
0 references
total vertex-edge dominating set
0 references
chordal graphs
0 references
trees
0 references
NP-completeness
0 references
APX-completeness
0 references
0.929079532623291
0 references
0.8915755748748779
0 references
0.8832229375839233
0 references
0.8789671063423157
0 references
0.8778802752494812
0 references
