From the 1 of 10 linked papers with an AI index.
10 papers
Maximum Edge Open Packing in Permutation, Interval, and Well-Partitioned Chordal Graphs
Gautam K. Das, Kamal Santra
Edge open packing is a relaxation of induced matching in which the selected edges may induce disjoint stars. We study the \textsc{Maximum Edge Open Packing} problem on permutation…
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-Type Domination on Convex and Chordal Bipartite Graphs: Algorithms and Hardness
Gautam K. Das, Kamal Santra
The paper investigates several Roman domination variants on convex and chordal bipartite graphs, providing polynomial‑time dynamic‑programming algorithms for convex bipartite graph…
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[…