#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2011

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Indra Rajasingh, Micheal Arockiaraj
- Mathematics in Computer Science
- 2011

- Paul D. Manuel, Micheal Arockiaraj, Indra Rajasingh, Bharati Rajan
- Discrete Applied Mathematics
- 2011

We consider the problem of embedding hypercubes into cylinders to minimize the wirelength. Further we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and in particular hypercubes into triangular snakes and caterpillars.

- Micheal Arockiaraj, Paul D. Manuel, Indra Rajasingh, Bharati Rajan
- Inf. Process. Lett.
- 2011

In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes,… (More)

- Micheal Arockiaraj, Jessie Abraham, Jasintha Quadras, Arul Jeya Shalini
- Int. J. Comput. Math.
- 2017

- Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel
- Journal of Interconnection Networks
- 2011

In this paper we formulate the Vertex Congestion Lemma leading to a new technique in computing the exact wirelength of an embedding. We compute the circular wirelength of generalized Petersen graphs by partitioning the vertices as well as the edges of cycles. Further we obtain the linear wirelength of circular ladders. Our algorithms produce optimal values… (More)

- Indra Rajasingh, Paul D. Manuel, Micheal Arockiaraj, Bharati Rajan
- J. Comb. Optim.
- 2013

- Indra Rajasingh, Paul D. Manuel, Bharati Rajan, Micheal Arockiaraj
- Discrete Applied Mathematics
- 2012

A lot of research has been devoted to finding efficient embedding of trees into hypercubes. On the other hand, in this paper, we consider the problem of embedding hypercubes into k-rooted complete binary trees, k-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength. © 2011 Elsevier B.V. All rights reserved.

- Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini
- Discrete Optimization
- 2015

- Indra Rajasingh, Micheal Arockiaraj, Jasintha Quadras, Arul Jeya Shalini
- Mathematics in Computer Science
- 2015

- Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel
- Inf. Process. Lett.
- 2012

In the paper [Exact wirelength of hypercube on a grid, Discrete Applied Mathematics, 157 (2009), no. 7, 1486 1495], the minimum wirelength of an -dimensional hypercube into a 2b2c £ 2d2e grid has been obtained. In this paper, we obtain the same when the 2b2c £ 2d2e rectangular grid is replaced by a generalized grid of size 21 £ 22 £ ¢ ¢ ¢ £ 2… (More)