Lekshmi Ramasubramony Sulochana

According to our database, Lekshmi Ramasubramony Sulochana authored at least 4 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Monitoring edge-geodetic sets in graphs.

Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana

Discret. Appl. Math., 2025

2023

Monitoring Edge-Geodetic Sets in Graphs.

Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2016

Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks.

Parisutham Nirmala, Lekshmi Ramasubramony Sulochana, Nadarajan Rethnasamy

Knowl. Inf. Syst., 2016

Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks.

Parisutham Nirmala, Lekshmi Ramasubramony Sulochana, Nadarajan Rethnasamy

Knowl. Inf. Syst., 2016