An improvement in the two-packing bound related to Vizing's conjecture
Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs. In this note we improve the recent bound of Breŝar by applying a technique of Zerbib to show that for any graphs G and H, γ(G x H)≥ γ (...
Збережено в:
| Автор: | |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Georgia Southern University
2020-04-01
|
| Серія: | Theory and Applications of Graphs |
| Предмети: | |
| Онлайн доступ: | https://digitalcommons.georgiasouthern.edu/tag/vol7/iss1/5 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|