| 2008 |
|---|
| 8 | EE | Paul D. Manuel,
Mostafa I. Abd-El-Barr,
Indra Rajasingh,
Bharati Rajan:
An efficient representation of Benes networks and its applications.
J. Discrete Algorithms 6(1): 11-19 (2008) |
| 7 | EE | Paul Manuel,
Bharati Rajan,
Indra Rajasingh,
Chris Monica M.:
On minimum metric dimension of honeycomb networks.
J. Discrete Algorithms 6(1): 20-27 (2008) |
| 2006 |
|---|
| 6 | | Paul Manuel,
Indra Rajasingh,
Bharati Rajan,
Albert Muthumalai:
On Induced Matching Partitions of Certain Interconnection Networks.
FCS 2006: 57-63 |
| 2004 |
|---|
| 5 | | S. Arumugam,
Indra Rajasingh,
P. Roushini Leely Pushpam:
On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number.
Ars Comb. 72: (2004) |
| 4 | EE | Indra Rajasingh,
Albert William,
Jasintha Quadras,
Paul Manuel:
Embedding of cycles and wheels into arbitrary trees.
Networks 44(3): 173-178 (2004) |
| 2003 |
|---|
| 3 | EE | Paul Manuel,
Bharati Rajan,
Indra Rajasingh,
Amutha Alaguvel:
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.
WG 2003: 334-345 |
| 2 | EE | Albert William,
Indra Rajasingh,
Jasintha Quadras,
Paul Manuel:
Embedding of Generalized Wheels into Arbitrary Trees.
Electronic Notes in Discrete Mathematics 15: 228-231 (2003) |
| 2001 |
|---|
| 1 | EE | S. Arumugam,
Indra Rajasingh,
P. Roushini Leely Pushpam:
Graphs whose acyclic graphoidal covering number is one less than its maximum degree.
Discrete Mathematics 240(1-3): 231-237 (2001) |
