- Title
- Improved bound for dilation of an embedding onto circulant networks
- Creator
- Sundara Rajan, R.; Rajalaxmi, T. M.; Ryan, Joe; Miller, Mirka
- Relation
- Applied Mathematics and Scientific Computing: International Conference on Advances in Mathematical Sciences, Vellore, India, December 2017 - Volume II p. 623-632
- Relation
- Trends in Mathematics
- Publisher Link
- http://dx.doi.org/10.1007/978-3-030-01123-9_62
- Publisher
- Springer
- Resource Type
- book chapter
- Date
- 2019
- Description
- Implementation of parallel algorithms and simulation of different interconnection networks need an effective tool, that is, graph embedding. This paper focuses on improving a lower bound obtained in Rajan et al. (Comput J 58:3271-3278, 2015) for dilation of an embedding onto circulant networks. In addition, this paper provides algorithms to compute dilation of embedding circulant network into certain trees, for instance, m-rooted complete binary tree, m-rooted sibling tree, and r-dimensional hypertree, proving that the improved bound obtained is sharp.
- Subject
- embedding; dilation; circulant network; binary tree; sibling tree; hypertree
- Identifier
- http://hdl.handle.net/1959.13/1451307
- Identifier
- uon:44150
- Identifier
- ISBN:9783030011239
- Language
- eng
- Hits: 1049
- Visitors: 1046
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|