Bases in sets and groups and their extremal problems have been studied in additive number theory such as the postage stamp problem. On the other hand, Cayloy graphs based on specific finite groups have been studied in algebraic graph theory and applied to construct efficient communication networks such as circular networks with minimum diameter (or transmission delay). In this paper we establish a framework which defines and unifies additive bases in groups, graphs and networks and survey results on the bases and their extremal problems. Some well known and well studied problems such as harmonious graphs and perfect addition sets are also shown to be special cases of the framework.
展开▼
