A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph (Q6611042)
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: A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph |
scientific article; zbMATH DE number 7919045
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph |
scientific article; zbMATH DE number 7919045 |
Statements
A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph (English)
0 references
26 September 2024
0 references
domination
0 references
total restrained domination
0 references
upper bound
0 references
0 references
0 references
0 references
