activity
20162026
collaborators

7 papers

math.GR2026

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…

math.CO2024

On metric dimension of cube of trees

Sanchita Paul, Bapan Das, Avishek Adhikari +1

Let be a connected graph and be the shortest distance between the vertices and in . A set is said to…

math.CO2023

Burning a binary tree and its generalization

Sandip Das, Sk Samim Islam, Ritam M Mitra +1

Graph burning is a graph process that models the spread of social contagion. Initially, all the vertices of a graph are unburnt. At each step, an unburnt vertex is put on fire…

math.CO2020

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…

math.CO2020

On characterizing proper-max-point tolerance graphs

Sanchita Paul

Max-point-tolerance graphs (MPTG) was introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in study of hu…

math.CO2017

On central-max-point tolerance graphs and some subclasses of interval catch digraphs

Sanchita Paul, Shamik Ghosh

Max-point-tolerance graphs (MPTG) were studied by Catanzaro et al. in 2017 and the same class of graphs were introduced in the name of p-BOX(1) graphs by Soto and Caro in 2015. In…

math.CO2016

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…