A note on the domination number of a bipartite graph (Q1600802)
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 1756463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the domination number of a bipartite graph |
scientific article; zbMATH DE number 1756463 |
Statements
A note on the domination number of a bipartite graph (English)
0 references
16 June 2002
0 references
Upper bounds on the domination number of a bipartite graph are established. The same approach leads to similar results for arbitrary graphs.
0 references
bipartite graph
0 references
domination number
0 references
