Bounding the search number of graph products
Combinatorics
2016-04-18 v1
Abstract
In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of arbitrary graphs G and H based on their respective clique numbers.
Cite
@article{arxiv.1604.04509,
title = {Bounding the search number of graph products},
author = {N. E. Clarke and M. E. Messinger and G. Power},
journal= {arXiv preprint arXiv:1604.04509},
year = {2016}
}