A Collaboration Graph of the Lilavati Prize Winners with Certain Domination Parameters

Abstract

The Lilavati Prize stands as a hallmark of excellence in the field of mathematics, recognizing outstanding contributions to the discipline. This study delves into the domination parameters exhibited by past Lilavati Prize winners, aiming to uncover the underlying factors contributing to their exceptional achievements. Through a meticulous analysis of their mathematical prowess, academic backgrounds, research methodologies, and societal impact, this research seeks to delineate the common traits and strategies employed by these laureates. Utilizing a combination of quantitative data analysis and qualitative assessments, we aim to provide insights into the intricate interplay between individual brilliance, collaborative endeavors, and institutional support in shaping mathematical excellence. By identifying key domination parameters among Lilavati Prize winners, this study not only offers valuable insights into the dynamics of mathematical achievement but also provides guidance for fostering future talent in the field.

In this present article, the collaboration graph of Lilavathi prize winners (2010-2022) was obtained with 14 nodes and 78 links. It will be quite time consuming to share a piece of information from a given node to any other node even though the whole network is connected. Moreover it demands more resources in terms of time, memory etc. To optimize the use of above resources the idea of computing the split domination, strong split domination, strong nonsplit domination, inverse domination, inverse non split domination, edge, outer connected, total connected, connected edge domination number and just excellent assumes significance. In this paper we aimed to find some particular domination parameters namely Split, Strong, Strong split, Inverse, connected, edge connected, outer connected , just excellent; domination & total domination number for the collaboration graph of Lilavathi prize winners.