Shirish Gosavi

activity

20232026

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2024

Graph Burning: Bounds and Hardness

Dhanyamol Antony, L. Sunil Chandran, Anita Das +3

Graph burning is a discrete-time process that models the propagation of information in a network. Given an undirected graph whose vertices are initially unburned, the process evolv…

math.CO2023

Spanning caterpillar in biconvex bipartite graphs

Dhanyamol Antony, Anita Das, Shirish Gosavi +2

A bipartite graph $G = (A, B, E)$ is said to be a biconvex bipartite graph if there exist orderings $<_{A}$ in $A$ and $<_{B}$ in $B$ such that the neighbors of every vertex in $A$ are c…