2 citations · 3 across the 16 of their papers we have counts for
7 papers · 1 filter
Maximum Edge Open Packing on AT-Free, Chordal, and Convex Bipartite Graphs
Gautam K. Das, Kamal Santra
An edge open packing is a set of edges whose endpoints induce a disjoint union of stars. We study the problem of finding a maximum edge open packing in AT-free, chordal, and convex…
Roman Domination on Circular-Convex, Triad-Convex Bipartite Graphs and -Tidy Graphs
Gautam K. Das, Kamal Santra
The Roman Domination Problem (RDP) on a graph \(G=(V,E)\) asks for a labeling function \(f:V\rightarrow\{0,1,2\}\) such that every vertex assigned value \(0\) is adjacent to a vert…
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
Roman domination and its variants form an important family of domination-type graph parameters motivated by protection, fault tolerance, and resource allocation. A Roman dominating…
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…