Subject | Mathematics |

Due By (Pacific Time) | 12/20/2016 10:00 pm |

I am solving a problem related to this paper http://www.umac.mo/rectors_office/docs/weizhao_cv/pub_refereed_conferences/2015_conferences/07069403.pdf. You only need to read section IV. You could solve my problem without reading other sections. My problem is if I place one node at each vertex of all the hexagons in figure 2 and 3. What's the upper bound and lower bound of the number of the nodes both in arbitrarily shaped area (like figure 2) and rectangle (like figure 3). This section omits some proofs, so I can't understand its proof. I need complete and detailed proof

Tutor | Rating |
---|---|

pallavi |
out of 1971 reviews |

amosmm |
out of 766 reviews |

PhyzKyd |
out of 1164 reviews |

rajdeep77 |
out of 721 reviews |

sctys |
out of 1600 reviews |

sharadgreen |
out of 770 reviews |

topnotcher |
out of 766 reviews |

XXXIAO |
out of 680 reviews |