Embeddings of graphs have important applications in Computer Science and are of particular interest in the area of interconnection networks. Dr. Sr. Jasintha’s work is a ground-breaking study in embedding techniques. The secret lies in creating the ability to estimate the congestion-sum of embedding different architectures. Sr. Jasintha works with a paradigm of graphs that includes cycles, wheels, generalized wheels, a class of caterpillars, hypercubes, and Petersen graphs as guest graphs and trees as host graphs; and she demonstrates a novel technique of computing the dilation-sum of graph embeddings. Highly commended as a doctoral thesis, the prominent feature of Dr. Sr. Jasintha’s study is that all the embeddings considered are elegant and they produce optimal congestion-sum in linear time. This opens up a world of possibilities for computer applications in network architecture. This study has inspired several other theses in the field of networking both internationally and at home.