On \(k\)-connected restrained domination in graphs. (Q2881271)
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: On k-connected restrained domination in graphs. |
scientific article; zbMATH DE number 6021495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(k\)-connected restrained domination in graphs. |
scientific article; zbMATH DE number 6021495 |
Statements
3 April 2012
0 references
restrained domination
0 references
2-connected restrained domination number
0 references
tree
0 references
unicyclic graph
0 references
On \(k\)-connected restrained domination in graphs. (English)
0 references
0.8545157313346863
0 references
0.8543000817298889
0 references
0.8437564373016357
0 references
0.8430700302124023
0 references
0.8407354950904846
0 references
