Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2989/16073606.2016.1188862 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2476671973 / rank | |||
Normal rank | |||
Revision as of 01:22, 20 March 2024
scientific article; zbMATH DE number 7117152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning the Vertices of a Graph into Two Total Dominating Sets |
scientific article; zbMATH DE number 7117152 |
Statements
Partitioning the Vertices of a Graph into Two Total Dominating Sets (English)
0 references
15 October 2019
0 references
total domination
0 references
vertex partitions
0 references
dominating sets
0 references
self-complementary graphs
0 references
