9 citations · 15 across the 23 of their papers we have counts for
27 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…
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-…
Cops and robber on variants of retracts and subdivisions of oriented graphs
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
\textsc{Cops and Robber} is one of the most studied two-player pursuit-evasion games played on graphs, where multiple \textit{cops}, controlled by one player, pursue a single \text…
On -chromatic numbers of graphs having bounded sparsity parameters
Sandip Das, Abhiruk Lahiri, Soumen Nandi +2
An -graph is characterised by having types of arcs and types of edges. A homomorphism of an -graph to an -graph , is a vertex mapping that prese…
On coloring parameters of triangle-free planar -graphs
Soumen Nandi, Sagnik Sen, S Taruni
An -graph is a graph with types of arcs and types of edges. A homomorphism of an -graph to another -graph is a vertex mapping that preserves th…
Counting the minimum number of arcs in an oriented graph having weak diameter 2
Sandip Das, Koushik Kumar Dey, Pavan P D +1
An oriented graph has weak diameter at most if every non-adjacent pair of vertices are connected by a directed -path. The function denotes the minimum number of arc…
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…
Triangle-free projective-planar graphs with diameter two: domination and characterization
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee +2
In 1975, Plesník characterized all triangle-free planar graphs as having a diameter . We characterize all triangle-free projective-planar graphs having a diameter and discus…
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…
On fractional version of oriented coloring
Sandip Das, Soham Das, Swathy Prabhu +1
We introduce the fractional version of oriented coloring and initiate its study. We prove some basic results and study the parameter for directed cycles and sparse planar graphs. I…
On subgraph complementation to H-free graphs
Dhanyamol Antony, Jay Garchar, Sagartanu Pal +3
For a class of graphs, the problem SUBGRAPH COMPLEMENT TO asks whether one can find a subset of vertices of the input graph such that complement…
On the signed chromatic number of some classes of graphs
Julien Bensmail, Sandip Das, Soumen Nandi +3
A signed graph is a graph along with a function . A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) num…
Pushable chromatic number of graphs with degree constraints
Julien Bensmail, Sandip Das, Soumen Nandi +4
Pushable homomorphisms and the pushable chromatic number of oriented graphs were introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any orie…
On relative clique number of colored mixed graphs
Sandip Das, Soumen Nandi, Debdeep Roy +1
An -colored mixed graph is a graph having arcs of different colors and edges of different colors. A graph homomorphism of an )-colored mixed graph to an…
Oriented Bipartite Graphs and the Goldbach Graph
Sandip Das, Prantar Ghosh, Shamik Ghosh +1
In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show…
On local structures of cubicity 2 graphs
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das +1
A 2-stab unit interval graph (2SUIG) is an axes-parallel unit square intersection graph where the unit squares intersect either of the two fixed lines parallel to the -axis, dis…
On a special class of boxicity 2 graphs
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das +1
We define and study a class of graphs, called 2-stab interval graphs (2SIG), with boxicity 2 which properly contains the class of interval graphs. A 2SIG is an axes-parallel rectan…
Chromatic number of signed graphs with bounded maximum degree
Sandip Das, Soumen Nandi, Soumyajit Paul +1
A signed graph is a graph positive and negative ( denotes the set of negative edges). To re-sign a vertex of a signed graph is to switch the signs of the…
On oriented cliques with respect to push operation
Julien Bensmail, Soumen Nandi, Sagnik Sen
To push a vertex of a directed graph is to change the orientations of all the arcs incident with . An oriented graph is a directed graph without any cyc…
On chromatic number of colored mixed graphs
Sandip Das, Soumen Nandi, Sagnik Sen
An -colored mixed graph is a graph with its arcs having one of the different colors and edges having one of the different colors. A homomorphism of an $(m,n)…
On homomorphism of oriented graphs with respect to push operation
Sagnik Sen
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex.…
Walk-powers and homomorphism bound of planar graphs
Reza Naserasr, Sagnik Sen, Qiang Sun
As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, .…