An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582)
From MaRDI portal
!
WARNING
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 5802635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the paired-domination number in terms of the number of edges in the graph |
scientific article; zbMATH DE number 5802635 |
Statements
An upper bound on the paired-domination number in terms of the number of edges in the graph (English)
0 references
19 October 2010
0 references
bounds
0 references
paired domination set
0 references
paired domination number
0 references
minimum degree 2
0 references
size
0 references
perfect matching
0 references
0 references
0.92820805311203
0 references
0.9150639176368712
0 references
0.8959339261054993
0 references
0.8922560811042786
0 references
0.8871948719024658
0 references
