6 papers
Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups
Shamik Ghosh, Sanchita Paul, M. K. Sen
The difference graph of a finite group is obtained from the edge difference between its intersection power graph and power graph, after deleting isolated vertices. This…
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…
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.
Characterizations of probe interval graphs
Shamik Ghosh, Maitry Podder, Malay K. Sen
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval repres…
Intersection representation of digraphs in trees with few leaves
In-Jen Lin, Malay K. Sen, Douglas B. West
The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other pa…