2 citations · 3 across the 16 of their papers we have counts for
14 papers · 1 filter
An Improved Upper Bound for the Strong Odd Chromatic Number of Planar Graphs
Kamal Santra
A proper coloring of a graph is called a strong odd coloring if, for every vertex \(v\) and every color appearing in the open neighborhood of \(v\), that color appears an odd numbe…
Roman domination on subclasses of bipartite graphs
Gautam K. Das, Sasmita Rout, Kamal Santra
The Roman Domination Problem (RDP) on a simple, finite, undirected graph \(G=(V,E)\) asks for a labeling function \(f:V\rightarrow\{0,1,2\}\) such that every vertex assigned value…
Algorithms for the Maximum Edge Open Packing Problem
Sriram Bhyravarapu, Gautam K. Das, Kamal Santra
Packing problems form a central theme in graph theory, owing to their relevance in modeling conflict-free resource allocation, network design, and communication constraints. Motiva…
Vertex-edge domination on subclasses of bipartite graphs
Arti Pandey, Kaustav Paul, Kamal Santra
Given a simple undirected graph , the open neighbourhood of a vertex is defined as , and the closed neighbourhood as $N_G[…
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…
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 is a mapping . A \emph{local invers…
Edge open packing: further characterizations
Arti Pandey, Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. In a graph , two edges are said to have \emph{common edge} $e\ne…
On total transitivity of graphs
Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say that \emph{dominates} if every…
On the Complexity and Algorithms for the Upper Domatic Number of Graphs
Subhabrata Paul, Kamal Santra
Let \(G\) be a graph. For two disjoint vertex sets \(A,B\subseteq V(G)\), we say that \(A\) dominates \(B\) if every vertex of \(B\) has a neighbour in \(A\). An upper domatic part…
Tournament transitivity of graphs
Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \textit{dominates} if every vert…
Strong transitivity of a graph
Subhabrata Paul, Kamal Santra
A vertex partition of is called a \emph{transitive partition} of size if dominates for all . For two disjoint su…
Algorithmic study on -transitivity of graphs
Subhabrata Paul, Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \emph{dominates} if every vertex…
Algorithmic study of -transitivity of graphs
Subhabrata Paul, Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \emph{dominates} if every vertex…
Transitivity on subclasses of chordal graphs
Subhabrata Paul, Kamal Santra
Let be a graph, where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \textit{dominates} if every ver…