Embeddings of circulant networks

Indra Rajasingh, Paul Manuel, M. Arockiaraj () and Bharati Rajan
Additional contact information
Indra Rajasingh: Loyola College
Paul Manuel: Kuwait University
M. Arockiaraj: Loyola College
Bharati Rajan: Loyola College

Journal of Combinatorial Optimization, 2013, vol. 26, issue 1, No 11, 135-151

Abstract: Abstract 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.

Keywords: Circulant networks; Multicyclic graphs; Embedding; Congestion; Wirelength (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9443-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-011-9443-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9443-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().