An Improved Bound for Upper Domination of Cartesian Products of Graphs
Combinatorics
2017-03-20 v1
Abstract
In this paper, we prove a problem proposed by Bre\v{s}ar: for any graphs and , , where denotes the upper domination number of .
Cite
@article{arxiv.1703.05861,
title = {An Improved Bound for Upper Domination of Cartesian Products of Graphs},
author = {Yu-Yen Chien},
journal= {arXiv preprint arXiv:1703.05861},
year = {2017}
}