2 citations · 3 across the 16 of their papers we have counts for
5 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…
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…
Transitivity on subclasses of bipartite graphs
Subhabrata Paul, Kamal Santra
Let be a graph where and are the vertex and edge set, respectively. For two disjoint subsets and , we say dominates if every vertex of is adja…