A new bound on maximum independent set and minimum connected dominating set in unit disk graphs

摘要

It is a conjecture that in any unit disk graph , where is the size of the maximum independent set in and is the size of minimum connected dominating set in . In this paper, we show that in any unit disk graph , . Currently, this is the best-known bound.