Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Domination in graphs: Vizing's conjecture
Vizing's conjecture remains one of the biggest open problems in domination in graph theory today. The conjecture states that the domination number of the Cartesian product of two graphs is at least as large as the product of the domination numbers of the two factor graphs. The aim of this thesis is...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Mathematics and Applied Mathematics
2023
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!