Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs. - Manoj Changat; Divya Sindhu Lekha; Henry Martyn Mulder; Ajitha R. Subhamathi (CALDAM, 2015)

The median game. - Manoj Changat; Divya Sindhu Lekha; Iztok Peterin; Ajitha R. Subhamathi; Simon Spacapan (Discret. Optim., 2015)

Algorithms for the remoteness function, and the median and antimedian sets in ℓ1-graphs. - Manoj Changat; Divya Sindhu Lekha; Ajitha R. Subhamathi (Int. J. Comput. Sci. Math., 2015)

Vulnerability of Complex Networks in Center-Based Attacks. - Kannan Balakrishnan; Divya Sindhu Lekha (CoRR, 2017)

Axiomatic characterization of the median and antimedian function on a complete graph minus a matching. - Manoj Changat; Divya Sindhu Lekha; Shilpa Mohandas; Henry Martyn Mulder; Ajitha R. Subhamathi (Discret. Appl. Math., 2017)

Generalized Vertex Transitivity in Graphs. - Kannan Balakrishnan; Divya Sindhu Lekha (CoRR, 2018)

Profile Closeness in Complex Networks. - Divya Sindhu Lekha; Sruthi K. S; Kannan Balakrishnan; A. Sreekumar (CoRR, 2019)

Need for a Realistic Measure of Attack Severity in Centrality Based Node Attack Strategies. - Jisha Mariyam John; Divya Sindhu Lekha (COMPLEX NETWORKS, 2021)

The median of Sierpiński graphs. - Kannan Balakrishnan; Manoj Changat; Andreas M. Hinz; Divya Sindhu Lekha (Discret. Appl. Math., 2022)