Embeddings of circulant networks

作者：Rajasingh Indra; Manuel Paul; Arockiaraj M^*; Rajan Bharati

来源：Journal of Combinatorial Optimization, 2013, 26(1): 135-151.

DOI：10.1007/s10878-011-9443-x

• Circulant networks
• Multicyclic graphs
• Embedding
• Congestion
• Wirelength

In this paper we solve the edge isoperimetric problem for circulant networks and consider the problem of embedding circulant networks into various graphs such as arbitrary trees, cycles, certain multicyclic graphs and ladders to yield the minimum wirelength.

• 出版日期2013-7