11 citations · 20 across the 29 of their papers we have counts for
5 papers · 1 filter
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…
The -Center Problem in Tree Networks Revisited
Aritra Banik, Binay Bhattacharya, Sandip Das +2
We present two improved algorithms for weighted discrete -center problem for tree networks with vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \lo…
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…