112 citations · 1.2k across the 56 of their papers we have counts for
6 papers · 1 filter
On some subclasses of circular-arc catch digraphs
Sanchita Paul, Sayan Gupta, Shamik Ghosh
Catch digraphs was introduced by Hiroshi Maehara in 1984 as an analog of intersection graphs where a family of pointed sets represents a digraph. After that Prisner continued his r…
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…
Characterization and recognition of proper tagged probe interval graphs
Sanchita Paul, Shamik Ghosh, Sourav Chakraborty +1
Interval graphs were used in the study of genomics by the famous molecular biologist Benzer. Later on probe interval graphs were introduced by Zhang as a generalization of interval…
An introduction to coding sequences of graphs
Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen
In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graph…
On certain classes of graceful lobsters
Shamik Ghosh
A graph G=(V,E) with m edges is graceful if it has a distinct vertex labeling f, a map from V into the set{0,1,2,3,...,m} which induces a distinct edge labeling |f(u)-f(v)| for edg…
A polynomial representation and a unique code of a simple undirected graph
Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.