Kumud Singh Porte

collaborators

2 papers

math.CO2026

Tight Upper Bounds on Color Reversal by Local Inversions

Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep

A bicoloration of a graph $G = (V, E)$ is a map $I^^{2} : V \to {- 1, 1}$ . A local inversion at a vertex $v$ complements the subgraph induced by the neighbors of $v$ and simultaneously revers…

math.CO2025

Improved upper bounds on color reversal by local inversions

Kumud Singh Porte, RB Sandeep, Kamal Santra

We study the problem of color reversal in bicolored graphs under local inversions. A \emph{bicoloration} of a graph $G = (V, E)$ is a mapping $I^^{2} : V \to {- 1, 1}$ . A \emph{local inver…