Grid embeddings are used not only to study the simulation capabilities of a parallel architecture but also to design its VLSI layout. In addition to dilation and congestion, wirelength is anâ€¦ (More)

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â€¦ (More)

A minimum metric basis is a minimum set W of vertices of a graph G(V,E) such that for every pair of vertices u and v of G, there exists a vertex w âˆˆ W with the condition that the length of a shortestâ€¦ (More)

In line with symmetrical graphs such as Cayley graphs and vertex transitive graphs, we introduce a new class of symmetrical graphs called diametrically uniform graphs. The class of diametricallyâ€¦ (More)

Importance of estimating the centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically countsâ€¦ (More)

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â€¦ (More)