No label defined (Q3758884)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4008449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4008449 |
Statements
1985
0 references
vertex-domination number
0 references
edge-domination number
0 references
0.8441128134727478
0 references
0.8309969902038574
0 references
0.8283712863922119
0 references
0.8281639218330383
0 references
0.8225089907646179
0 references
[For the entire collection see Zbl 0619.00006.] The vertex-domination number \(\gamma\) (G) and the edge-domination number \(\gamma_ 1(G)\) are the minimum numbers of vertices that dominate V(G) and the minimum number of edges that dominate E(G), respectively. Sets of vertices that strongly dominate E(G) and sets of edges that strongly dominate V(G) are studied. A vertex v and an edge \(e=uw\) strongly dominate each other if either i) \(v=u\) or \(v=w\), or ii) both vu and vw are in E(G). The parameters \(s\gamma_{01}(G)\) and \(s\gamma_{10}(G)\) are introduced and studied, where the former is the minimum number of vertices that strongly dominate the edge set and the latter is the minimum number of edges that strongly dominate the vertex set. In fact, the parameter \(s\gamma_{01}(G)\) equals the neighbourhood number of G, first introduced by Sampathkumar and Neeralagi.
0 references