I. Rajasingh

collaborators

3 papers

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 $G$ that starts with $k > 0$ burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as…

math.CO2019

A Lower Bound and Several Exact Results on the $d$ -Lucky Number

Sandi Klavžar, Indra Rajasingh, D. Ahima Emilet

If $ℓ : V (G) \to N$ is a vertex labeling of a graph $G = (V (G), E (G))$ , then the $d$ -lucky sum of a vertex $u \in V (G)$ is $d_\ell(u) = d_G(u) + \sum_{v\in N(u)}\…

math.CO2019

Domination Parameters in Hypertrees and Sibling trees

Indra Rajasingh, R. Jayagopal, R. Sundara Rajan

A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V (G) ∖ S$ , $N (u) \cap S \neq = N (v) \cap S$ . The…

APX-Hardness and Approximation for the k-Burning Number Problem

A Lower Bound and Several Exact Results on the d-Lucky Number

Domination Parameters in Hypertrees and Sibling trees

A Lower Bound and Several Exact Results on the $d$ -Lucky Number