1 citations · 2 across the 4 of their papers we have counts for
6 papers
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…
Edge Forcing in Butterfly Networks
Jessy Sujana G., T. M. Rajalaxmi, Indra Rajasingh +1
A zero forcing set is a set of vertices of a graph , called forced vertices of , which are able to force the entire graph by applying the following process iteratively: A…
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…
A Lower Bound and Several Exact Results on the -Lucky Number
Sandi Klavžar, Indra Rajasingh, D. Ahima Emilet
If is a vertex labeling of a graph , then the -lucky sum of a vertex is $d_\ell(u) = d_G(u) + \sum_{v\in N(u)}\…
Domination Parameters in Hypertrees and Sibling trees
Indra Rajasingh, R. Jayagopal, R. Sundara Rajan
A locating-dominating set (LDS) of a graph is a dominating set of such that for every two vertices and in , . The…
Towards Investigating Substructures and Role Recognition in Goal Oriented Online Communities
Tanmay Sinha, Indra Rajasingh
In this paper, we apply social network analytic methods to unveil the structural dynamics of a popular open source goal oriented IRC community, Ubuntu. The primary objective is to…