Half domination arrangements in regular and semi-regular tessellation type graphs

Details Half domination arrangements in regular and semi-regular tessellation type graphs Half domination arrangements in regular and semi-regular tessellation type graphs

2012-01-23

arxiv.org/abs/1201.4624v1

Mathematics

Combinatorics

14 pages, 12 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Half domination arrangements in regular and semi-regular tessellation type graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Half domination arrangements in regular and semi-regular tessellation type graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Half domination arrangements in regular and semi-regular tessellation type graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-496325