On \(n\)-inverse domination number in graphs (Q3085677)
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 n-inverse domination number in graphs |
scientific article; zbMATH DE number 5873086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(n\)-inverse domination number in graphs |
scientific article; zbMATH DE number 5873086 |
Statements
31 March 2011
0 references
graph
0 references
domination
0 references
inverse domination
0 references
\(n\)-total domination
0 references
\(n\)-inverse domination
0 references
0.8964807391166687
0 references
0.8794364333152771
0 references
0.8645015358924866
0 references
0.8540347814559937
0 references
