Half domination arrangements in regular and semi-regular tessellation type graphs
Combinatorics
2015-03-13 v1 Optimization and Control
Abstract
We study the problem of half-domination sets of vertices in vertex transitive infinite graphs generated by regular or semi-regular tessellations of the plane. In some cases, the results obtained are sharp and in the rest, we show upper bounds for the average densities of vertices in half-domination sets.
Cite
@article{arxiv.1201.4624,
title = {Half domination arrangements in regular and semi-regular tessellation type graphs},
author = {Eugen J. Ionascu},
journal= {arXiv preprint arXiv:1201.4624},
year = {2015}
}
Comments
14 pages, 12 figures