Kamal Santra

activity

20222026

most citedTransitivity on subclasses of bipartite graphs

2 citations · 3 across the 16 of their papers we have counts for

collaborators

Showing 2025Show all

5 papers · 1 filter

math.CO2025

Vertex-edge domination on subclasses of bipartite graphs

Arti Pandey, Kaustav Paul, Kamal Santra

Given a simple undirected graph $G = (V, E)$ , the open neighbourhood of a vertex $v \in V$ is defined as $N_{G} (v) = {u \in V ∣ uv \in E}$ , and the closed neighbourhood as $N_G[…

math.CO2025

Edge open packing on subclasses of chordal graphs

Kamal Santra

Packing problems in graphs are fundamental in combinatorial optimization and arise naturally in applications such as resource allocation, scheduling, and communication networks. A…

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 $β : V \to {- 1, 1}$ . A \emph{local invers…

math.CO2025

Edge open packing: further characterizations

Arti Pandey, Kamal Santra

Let $G = (V, E)$ be a graph where $V (G)$ and $E (G)$ are the vertex and edge sets, respectively. In a graph $G$ , two edges $e_{1}, e_{2} \in E (G)$ are said to have \emph{common edge} $e\ne…

math.CO2025

On total transitivity of graphs

Kamal Santra

Let $G = (V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$ , we say that $A$ \emph{dominates} $B$ if every…