The influence of special vertices on strong domination (Q1292872): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4387715 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3291034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on the strong domination number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong weak domination and domination balance in a graph / rank | |||
Normal rank | |||
Latest revision as of 21:36, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The influence of special vertices on strong domination |
scientific article |
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
