2 papers
cs.DC2025
Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
Rajashree Bar, Daibik Barik, Adri Bhattacharya +1
Network decontamination is a well-known problem, in which the aim of the mobile agents should be to decontaminate the network (i.e., both nodes and edges). This problem comes with…
math.CO2024
Asymmetric Colorings of Disjoint Unions of Graphs
Bruno Aguilar, Daibik Barik, Jetharam Bhambhu +7
The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investig…