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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.06.033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060681653 / rank | |||
Normal rank | |||
Revision as of 22:34, 19 March 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
