The distant-2 chromatic number of random proximity and random geometric graphs Academic Article uri icon

abstract

  • We are interested in finding bounds for the distant-2 chromatic number of geometric graphs drawn from different models. We consider two undirected models of random graphs: random geometric graphs and random proximity graphs for which sharp connectivity thresholds have been shown. We are interested in a.a.s. connected graphs close just above the connectivity threshold. For such subfamilies of random graphs we show that the distant-2-chromatic number is @Q(logn) with high probability. The result on random geometric graphs is extended to the random sector graphs defined in [J. Diaz, J. Petit, M. Serna. A random graph model for optical networks of sensors, IEEE Transactions on Mobile Computing 2 (2003) 143-154].

publication date

  • January 1, 2008