1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
On identifying codes on oriented graphs
Soura Sena Das, Sagnik Sen
This article studies identifying codes in oriented graphs from a computational complexity perspective. We investigate the -Id Code problem, where given a simple graph…
cs.DM2026
On multiplicativity of directed graphs
Soura Sena Das, Moritz Mühlenthaler, Sagnik Sen +1
A graph category is a category with a set of graphs or similar structures (such as, directed graphs, signed graphs, etc.) playing the role of objects, and an appropriate notion of…
cs.DM2022
On homomorphism related parameters of oriented triangle-free planar graphs
Soura Sena Das, Soumen Nandi, Sagnik Sen
The first major contribution of this work is proving that the oriented relative clique number of oriented triangle-free planar graphs is , which completely answers and closes a…