An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:59, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the paired-domination number in terms of the number of edges in the graph |
scientific article |
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
