Asympototic result for distance constrained labeling of graphs
摘要
This talk also discusses distance constrained labelings of
graphs, but concentrate on asympototic results. We show that
l2,1(G)
£
O(D(3/2)) for chordal graph G of maximum degree D. The
presented bound is assymptotically tight. We will also discuss
recent approaches to the study of the dependence of
l
p1,...,pk(G) on the parameters p1,...,pk.
∼Daniel Kral 教授演講摘要∼