Some lower bounds for a class of frequency assignment problems

Abstract

Lower bounds for the number of frequencies required by solutions of certain frequency assignment problems are derived. The bounds constitute generalizations of the clique number, which appears in the pure co-channel case, to problems including adjacent channel and co-site constraints as well as preassigned and blocked frequencies. Examples of mobile telephone systems are studied with the aid of these bounds.