Extremal graphs for a new upper bound on domination parameters in graphs (Q2433699)
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 5068497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal graphs for a new upper bound on domination parameters in graphs |
scientific article; zbMATH DE number 5068497 |
Statements
Extremal graphs for a new upper bound on domination parameters in graphs (English)
0 references
30 October 2006
0 references
The authors improve an inequality on the domination number of a graph established by Berge and others, and give a characterization of the trees that achieve equality in the established inequality.
0 references
irredundance
0 references
0.839344322681427
0 references
0.8316963315010071
0 references
0.7921698093414307
0 references
0.7880614995956421
0 references
0.7870665788650513
0 references
