Half domination arrangements in regular and semi-regular tessellation type graphs
classification
🧮 math.CO
math.OC
keywords
graphshalf-dominationregularsemi-regularsetsverticesarrangementsaverage
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.