首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Embeddings of circulant networks
Authors:Indra Rajasingh  Paul Manuel  M Arockiaraj  Bharati Rajan
Institution:1. Department of Mathematics, Loyola College, Chennai, 600 034, India
2. Department of Information Science, Kuwait University, Safat, Kuwait
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:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号