Kaustav Paul

activity

20242026

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Locating-dominating partitions for some classes of graphs

Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul +1

A dominating set of a graph $G$ is a set $D \subseteq V (G)$ such that every vertex in $V (G) ∖ D$ is adjacent to at least one vertex in $D$ . A set $L \subseteq V (G)$ is a loc…

math.CO2025

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes

Florent Foucaud, Arti Pandey, Kaustav Paul

Given a graph $G = (V, E)$ , a set $S \subseteq V$ is said to be a monitoring edge-geodetic set if the deletion of any edge in the graph results in a change in the distance between at l…