Kamal Santra

collaborators

4 papers

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.CO2023

Strong transitivity of a graph

Subhabrata Paul, Kamal Santra

A vertex partition $π = {V_{1}, V_{2}, \dots, V_{k}}$ of $G$ is called a \emph{transitive partition} of size $k$ if $V_{i}$ dominates $V_{j}$ for all $1 \leq i < j \leq k$ . For two disjoint su…

math.CO2023

Algorithmic study on $2$ -transitivity of graphs

Subhabrata Paul, 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 $A$ \emph{dominates} $B$ if every vertex…

math.CO2023

Algorithmic study of $d_{2}$ -transitivity of graphs

Subhabrata Paul, 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 $A$ \emph{dominates} $B$ if every vertex…

Edge open packing: further characterizations

Strong transitivity of a graph

Algorithmic study on 2-transitivity of graphs

Algorithmic study of d2​-transitivity of graphs

Algorithmic study on $2$ -transitivity of graphs

Algorithmic study of $d_{2}$ -transitivity of graphs