The influence of special vertices on strong domination (Q1292872)
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: The influence of special vertices on strong domination |
scientific article; zbMATH DE number 1322047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The influence of special vertices on strong domination |
scientific article; zbMATH DE number 1322047 |
Statements
The influence of special vertices on strong domination (English)
0 references
5 December 1999
0 references
A set \(D\) of vertices of a graph \(G=(V,E)\) is a strong dominating set if any vertex \(y\in V-D\) has a neighbour \(x\in D\) so that the degree of \(x\) is greater than or equal to the degree of \(y\). A bound on the strong domination number, the minimum cardinality of a strong dominating set, is given.
0 references
strong domination number
0 references
0.9063220024108888
0 references
0.8720486760139465
0 references
0.8484104871749878
0 references
