I
Indra Rajasingh
Researcher at VIT University
Publications - 128
Citations - 1092
Indra Rajasingh is an academic researcher from VIT University. The author has contributed to research in topics: Embedding & Vertex (geometry). The author has an hindex of 17, co-authored 125 publications receiving 917 citations. Previous affiliations of Indra Rajasingh include Loyola College, Chennai & Loyola University Chicago.
Papers
More filters
Journal ArticleDOI
On minimum metric dimension of honeycomb networks
TL;DR: This paper determines minimum metric bases for hexagonal and honeycomb networks by using the duality of these networks to determine a minimum metric basis for these networks.
Journal ArticleDOI
Exact wirelength of hypercubes on a grid
TL;DR: This paper gives an exact formula of minimum wirelength of hypercube layout into grids and thereby it solves completely the wirelength problem of hypercubes into grids.
Journal ArticleDOI
An efficient representation of Benes networks and its applications
TL;DR: A new topological representation of butterfly and Benes networks is identified and it is shown that the minimum metric dimension problem remains NP-hard for bipartite graphs.
Journal ArticleDOI
Embedding of cycles and wheels into arbitrary trees
TL;DR: This work estimates and characterize the edge congestion‐sum measure for embeddings of various graphs such as cycles, wheels, and generalized wheels into arbitrary trees and produces optimal values of sum of dilations and sum of edge‐congestions in linear time.
Computing Szeged Index of Certain Nanosheets Using Partition Technique
TL;DR: The Szeged index as discussed by the authors is a molecular structure descriptor equal to the sum of products over all edges of the molecular graph G, where neu(e|G )i s the number of vertices whose distance to vertex u is smaller than the distance u to vertex v,a nd wherenev(e |G) is defined analogously.