Computation of certain domination numbers of collaboration graphs (Q6988905)
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 8035334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of certain domination numbers of collaboration graphs |
scientific article; zbMATH DE number 8035334 |
Statements
Computation of certain domination numbers of collaboration graphs (English)
0 references
30 April 2025
0 references
collaboration graph
0 references
Erdős number
0 references
Rolf Nevanlinna prize
0 references
strong dominating set
0 references
weak dominating set
0 references
strong domination number
0 references
weak domination number
0 references
\(k\)-distance chromatic number
0 references
acyclic chromatic number
0 references
