A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6611090)
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 7919085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set |
scientific article; zbMATH DE number 7919085 |
Statements
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (English)
0 references
26 September 2024
0 references
total domination
0 references
independent domination
0 references
vertex partitions
0 references
0 references
0.9015146493911744
0 references
0.8781000971794128
0 references
0.8658480048179626
0 references
0.8591778874397278
0 references
0.8347241282463074
0 references
