1 citations · 1 across the 5 of their papers we have counts for
6 papers
Optimal -locating-dominating codes in infinite triangular grid
Soura Sena Das, Tuomo Lehtilä, Sagnik Sen
We study two variants of location-domination in infinite triangular grids which allow locating up to vertices simultaneously. A locating-dominating code is a dominating…
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…
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…
On the number of irreducible factors with a given multiplicity in function fields
Sourabhashis Das, Ertan Elma, Wentang Kuo +1
Let be a natural number and be a monic polynomial. Let denote the number of distinct monic irreducible factors of with multiplicity…
A theoretical expansion of the Sprout game
Soura Sena Das, Zin Mar Myint, Soumen Nandi +2
Sprout is a two-player pen and paper game which starts with vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-…
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…