I. Reddy

activity

20152026

most citedThe Parameterized Complexity of Happy Colorings

2 citations · 3 across the 11 of their papers we have counts for

collaborators

14 papers

math.CO2026

On the complexity of global Roman domination problem in graphs

Sangam Balchandar Reddy, Arun Kumar Das, Anjeneya Swami Kare +1

A Roman dominating function of a graph $G = (V, E)$ is a labeling $f : V \to {0, 1, 2}$ such that for each vertex $u \in V$ with $f (u) = 0$ , there exists a vertex $v \in N(…

math.CO2023

Star Coloring of Tensor Product of Two Graphs

Harshit Kumar Choudhary, Swati Kumari, I. Vinod Reddy

A star coloring of a graph $G$ is a proper vertex coloring such that no path on four vertices is bicolored. The smallest integer $k$ for which $G$ admits a star coloring with $k$ c…

math.CO2023

On Color Critical Graphs of Star Coloring

Harshit Kumar Choudhary, I. Vinod Reddy

A \emph{star coloring} of a graph $G$ is a proper vertex-coloring such that no path on four vertices is $2$ -colored. The minimum number of colors required to obtain a star coloring…

math.CO2023

On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

For a positive integer $k$ , a proper $k$ -coloring of a graph $G$ is a mapping $f : V (G) \to {1, 2, \dots, k}$ such that $f (u) \neq = f (v)$ for each edge $uv$ of $G$ . The sma…

cs.DS2022

On Structural Parameterizations of Star Coloring

Sriram Bhyravarapu, I. Vinod Reddy

A Star Coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum number of colors required for such a…

cs.DM2021

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang +2

A conflict-free coloring of a graph $G$ is a (partial) coloring of its vertices such that every vertex $u$ has a neighbor whose assigned color is unique in the neighborhood of $u$ .…