The ratio of the distance irredundance and domination numbers of a graph (Q4277983)
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 ratio of the distance irredundance and domination numbers of a graph |
scientific article; zbMATH DE number 490722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The ratio of the distance irredundance and domination numbers of a graph |
scientific article; zbMATH DE number 490722 |
Statements
The ratio of the distance irredundance and domination numbers of a graph (English)
0 references
26 January 1994
0 references
\(n\)-domination number
0 references
\(n\)-irredundance number
0 references
distance
0 references
tree
0 references
bound
0 references
0.8475372195243835
0 references
0.8430641889572144
0 references
0.8337398171424866
0 references
