1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2022★ 1 cited
Oriented Diameter of Planar Triangulations
Debajyoti Mondal, N. Parthiban, Indra Rajasingh
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph , we exa…
cs.CC2020
APX-Hardness and Approximation for the k-Burning Number Problem
Debajyoti Mondal, N. Parthiban, V. Kavitha +1
Consider an information diffusion process on a graph that starts with burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as…
cs.DM2017
A note on minimum linear arrangement for BC graphs
Xiaofang Jiang, Qinghui Liu, Natarajan Parthiban +1
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective conne…