S. Paul

activity

20202026

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

On metric dimension of cube of trees

Sanchita Paul, Bapan Das, Avishek Adhikari +1

Let $G = (V, E)$ be a connected graph and $d_{G} (u, v)$ be the shortest distance between the vertices $u$ and $v$ in $G$ . A set $S = {s_{1}, s_{2}, \dots, s_{n}} \subset V (G)$ 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 $G$ are unburnt. At each step, an unburnt vertex is put on fire…

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…