Channel assignment on Cayley graphs
We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group ? with a certain kind of presentation, then ?(G;k, 1)?2(k+n?1). For certain values of k this bound gives the obvious optimal value for any 2n-regular graph. A large number of groups (for instance, even Artin groups and a number of BaumslagSolitar groups) satisfy this condition.  2010 Wiley Periodicals, Inc. J Graph Theory 67: 169-177, 2011
channel assignment cayley graph frequency assignment l(2 1)-labeling