Deepak Rajendraprasad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Deepak Rajendraprasad has a total of 90 co-authors. Here are the top co-authors by number of shared publications:
L. Sunil Chandran
Department of Computer Science and Automation Indian Institute of Science Bangalore India
17 shared publications- L. Sunil Chandran
Department of Computer Science and Automation Indian Institute of Science Bangalore India
16 shared publications - Rogers Mathew
Department of Computer Science and Engineering Indian Institute of Technology Hyderabad
11 shared publications Rogers Mathew
Department of Computer Science Indian Institute of Technology Kharagpur India
9 shared publicationsManu Basavaraju
Department of Computer Science and Engineering National Institute of Technology Karnataka India
8 shared publicationsJasine Babu
C/O The Sheridan Press, PO Box 465, Hanover, PA 17331 USA
7 shared publications
Latest Publications
- 13 February 2026
- Published by Springer Nature
- p. 71-83
On Optimal Achromatic Coloring of 3-Uniform Tight Cycles
- 13 February 2026
- Published by Springer Nature
- p. 71-83
On Optimal Achromatic Coloring of 3-Uniform Tight Cycles
- 17 July 2025
- Published by Wiley in Journal of Graph Theory
Independent Domination Number of Planar Triangulations
We show that every planar triangulation on vertices has a maximal independent set of size at most . This affirms a conjecture by Botler, Fernandes, and Gutiérrez (Electron. J. Comb., 2024) based on an open question of Goddard and Henning (Appl. Math. Comput., 2020). Since a maximal independent set is a special type of dominating set (independent dominating set), this is a structural strengthening of a major result by Matheson and Tarjan (Eur. J. Comb., 1996) that every triangulated disc has a dominating set of size at most , but restricted to triangulations.
- 17 July 2025
- Published by Wiley in Journal of Graph Theory
Independent Domination Number of Planar Triangulations
We show that every planar triangulation on vertices has a maximal independent set of size at most . This affirms a conjecture by Botler, Fernandes, and Gutiérrez (Electron. J. Comb., 2024) based on an open question of Goddard and Henning (Appl. Math. Comput., 2020). Since a maximal independent set is a special type of dominating set (independent dominating set), this is a structural strengthening of a major result by Matheson and Tarjan (Eur. J. Comb., 1996) that every triangulated disc has a dominating set of size at most , but restricted to triangulations.
- Open Access
Multipacking in Hypercubes
For an undirected graph $G$, a dominating broadcast on $G$ is a function $f : V(G) \rightarrow \mathbb{N}$ such that for any vertex $u \in V(G)$, there exists a vertex $v \in V(G)$ with $f(v) \geqslant 1$ and $d(u,v) \leqslant f(v)$. The cost of $f$ is $\sum_{v \in V} f(v)$. The minimum cost over all the dominating broadcasts on $G$ is defined as the broadcast domination number $γ_b(G)$ of $G$. A multipacking in $G$ is a subset $M \subseteq V(G)$ such that, for every vertex $v \in V(G)$ and every positive integer $r$, the number of vertices in $M$ within distance $r$ of $v$ is at most $r$. The multipacking number of $G$, denoted $\operatorname{mp}(G)$, is the maximum cardinality of a multipacking in $G$. These two optimisation problems are duals of each other, and it easily follows that $\operatorname{mp}(G) \leqslant γ_b(G)$. It is known that $γ_b(G) \leqslant 2\operatorname{mp}(G)+3$ and conjectured that $γ_b(G) \leqslant 2\operatorname{mp}(G)$. In this paper, we show that for the $n$-dimensional hypercube $Q_n$ $$ \left\lfloor\frac{n}{2} \right\rfloor \leqslant \operatorname{mp}(Q_n) \leqslant \frac{n}{2} + 6\sqrt{2n}. $$ Since $γ_b(Q_n) = n-1$ for all $n \geqslant 3$, this verifies the above conjecture on hypercubes and, more interestingly, gives a sequence of connected graphs for which the ratio $\frac{γ_b(G)}{\operatorname{mp}(G)}$ approaches $2$, a search for which was initiated by Beaudou, Brewster and Foucaud in 2018. It follows that, for connected graphs $G$ $$ \limsup_{\operatorname{mp}(G) \rightarrow \infty} \left\{\frac{γ_b(G)}{\operatorname{mp}(G)}\right\} = 2.$$ The lower bound on $\operatorname{mp}(Q_n)$ is established by a recursive construction, and the upper bound is established using a classic result from discrepancy theory.Open AccessMultipacking in Hypercubes
For an undirected graph $G$, a dominating broadcast on $G$ is a function $f : V(G) \rightarrow \mathbb{N}$ such that for any vertex $u \in V(G)$, there exists a vertex $v \in V(G)$ with $f(v) \geqslant 1$ and $d(u,v) \leqslant f(v)$. The cost of $f$ is $\sum_{v \in V} f(v)$. The minimum cost over all the dominating broadcasts on $G$ is defined as the broadcast domination number $γ_b(G)$ of $G$. A multipacking in $G$ is a subset $M \subseteq V(G)$ such that, for every vertex $v \in V(G)$ and every positive integer $r$, the number of vertices in $M$ within distance $r$ of $v$ is at most $r$. The multipacking number of $G$, denoted $\operatorname{mp}(G)$, is the maximum cardinality of a multipacking in $G$. These two optimisation problems are duals of each other, and it easily follows that $\operatorname{mp}(G) \leqslant γ_b(G)$. It is known that $γ_b(G) \leqslant 2\operatorname{mp}(G)+3$ and conjectured that $γ_b(G) \leqslant 2\operatorname{mp}(G)$. In this paper, we show that for the $n$-dimensional hypercube $Q_n$ $$ \left\lfloor\frac{n}{2} \right\rfloor \leqslant \operatorname{mp}(Q_n) \leqslant \frac{n}{2} + 6\sqrt{2n}. $$ Since $γ_b(Q_n) = n-1$ for all $n \geqslant 3$, this verifies the above conjecture on hypercubes and, more interestingly, gives a sequence of connected graphs for which the ratio $\frac{γ_b(G)}{\operatorname{mp}(G)}$ approaches $2$, a search for which was initiated by Beaudou, Brewster and Foucaud in 2018. It follows that, for connected graphs $G$ $$ \limsup_{\operatorname{mp}(G) \rightarrow \infty} \left\{\frac{γ_b(G)}{\operatorname{mp}(G)}\right\} = 2.$$ The lower bound on $\operatorname{mp}(Q_n)$ is established by a recursive construction, and the upper bound is established using a classic result from discrepancy theory. - Open Access
Color-Constrained Arborescences in Edge-Colored Digraphs
Given a multigraph $G$ whose edges are colored from the set $[q]:=\{1,2,\ldots,q\}$ (\emph{$q$-colored graph}), and a vector $α=(α_1,\ldots,α_{q}) \in \mathbb{N}^{q}$ (\emph{color-constraint}), a subgraph $H$ of $G$ is called \emph{$α$-colored}, if $H$ has exactly $α_i$ edges of color $i$ for each $i \in[q]$. In this paper, we focus on $α$-colored arborescences (spanning out-trees) in $q$-colored multidigraphs. We study the decision, counting and search versions of this problem. It is known that the decision and search problems are polynomial-time solvable when $q=2$ and that the decision problem is NP-complete when $q$ is arbitrary. However the complexity status of the problem for fixed $q$ was open for $q > 2$. We show that, for a $q$-colored digraph $G$ and a vertex $s$ in $G$, the number of $α$-colored arborescences in $G$ rooted at $s$ for all color-constraints $α\in \mathbb{N}^q$ can be read from the determinant of a symbolic matrix in $q-1$ indeterminates. This result extends Tutte's matrix-tree theorem for directed graphs and gives a polynomial-time algorithm for the counting and decision problems for fixed $q$. We also use it to design an algorithm that finds an $α$-colored arborescence when one exists. Finally, we study the weighted variant of the problem and give a polynomial-time algorithm (when $q$ is fixed) which finds a minimum weight solution.Open AccessColor-Constrained Arborescences in Edge-Colored Digraphs
Given a multigraph $G$ whose edges are colored from the set $[q]:=\{1,2,\ldots,q\}$ (\emph{$q$-colored graph}), and a vector $α=(α_1,\ldots,α_{q}) \in \mathbb{N}^{q}$ (\emph{color-constraint}), a subgraph $H$ of $G$ is called \emph{$α$-colored}, if $H$ has exactly $α_i$ edges of color $i$ for each $i \in[q]$. In this paper, we focus on $α$-colored arborescences (spanning out-trees) in $q$-colored multidigraphs. We study the decision, counting and search versions of this problem. It is known that the decision and search problems are polynomial-time solvable when $q=2$ and that the decision problem is NP-complete when $q$ is arbitrary. However the complexity status of the problem for fixed $q$ was open for $q > 2$. We show that, for a $q$-colored digraph $G$ and a vertex $s$ in $G$, the number of $α$-colored arborescences in $G$ rooted at $s$ for all color-constraints $α\in \mathbb{N}^q$ can be read from the determinant of a symbolic matrix in $q-1$ indeterminates. This result extends Tutte's matrix-tree theorem for directed graphs and gives a polynomial-time algorithm for the counting and decision problems for fixed $q$. We also use it to design an algorithm that finds an $α$-colored arborescence when one exists. Finally, we study the weighted variant of the problem and give a polynomial-time algorithm (when $q$ is fixed) which finds a minimum weight solution. - Open Access
Maximal Independent Sets in Planar Triangulations
We show that every planar triangulation on $n$ vertices has a maximal independent set of size at most $n/3$. This affirms a conjecture by Botler, Fernandes and Gutiérrez [Electron.\ J.\ Comb., 2024], which in turn would follow if an open question of Goddard and Henning [Appl.\ Math.\ Comput., 2020] which asks if every planar triangulation has three disjoint maximal independent sets were answered in the affirmative. Since a maximal independent set is a special type of dominating set (independent dominating set), this is a structural strengthening of a major result by Matheson and Tarjan [Eur.\ J.\ Comb., 1996] that every triangulated disc has a dominating set of size at most $n/3$, but restricted to triangulations.Open AccessMaximal Independent Sets in Planar Triangulations
We show that every planar triangulation on $n$ vertices has a maximal independent set of size at most $n/3$. This affirms a conjecture by Botler, Fernandes and Gutiérrez [Electron.\ J.\ Comb., 2024], which in turn would follow if an open question of Goddard and Henning [Appl.\ Math.\ Comput., 2020] which asks if every planar triangulation has three disjoint maximal independent sets were answered in the affirmative. Since a maximal independent set is a special type of dominating set (independent dominating set), this is a structural strengthening of a major result by Matheson and Tarjan [Eur.\ J.\ Comb., 1996] that every triangulated disc has a dominating set of size at most $n/3$, but restricted to triangulations. - Open Access
Face-hitting Dominating Sets in Planar Graphs
A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$. A face-hitting set of a plane graph $G$ is a set $T$ of vertices in $G$ such that every face of $G$ contains at least one vertex of $T$. We show that the vertex-set of every plane (multi-)graph without isolated vertices, self-loops or $2$-faces can be partitioned into two disjoint sets so that both the sets are dominating and face-hitting. We also show that all the three assumptions above are necessary for the conclusion. As a corollary, we show that every $n$-vertex simple plane triangulation has a dominating set of size at most $(1 - α)n/2$, where $αn$ is the maximum size of an independent set in the triangulation. Matheson and Tarjan [European J. Combin., 1996] conjectured that every plane triangulation with a sufficiently large number of vertices $n$ has a dominating set of size at most $n / 4$. Currently, the best known general bound for this is by Christiansen, Rotenberg and Rutschmann [SODA, 2024] who showed that every plane triangulation on $n > 10$ vertices has a dominating set of size at most $2n/7$. Our corollary improves their bound for $n$-vertex plane triangulations which contain a maximal independent set of size either less than $2n/7$ or more than $3n/7$.Open AccessFace-hitting Dominating Sets in Planar Graphs
A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$. A face-hitting set of a plane graph $G$ is a set $T$ of vertices in $G$ such that every face of $G$ contains at least one vertex of $T$. We show that the vertex-set of every plane (multi-)graph without isolated vertices, self-loops or $2$-faces can be partitioned into two disjoint sets so that both the sets are dominating and face-hitting. We also show that all the three assumptions above are necessary for the conclusion. As a corollary, we show that every $n$-vertex simple plane triangulation has a dominating set of size at most $(1 - α)n/2$, where $αn$ is the maximum size of an independent set in the triangulation. Matheson and Tarjan [European J. Combin., 1996] conjectured that every plane triangulation with a sufficiently large number of vertices $n$ has a dominating set of size at most $n / 4$. Currently, the best known general bound for this is by Christiansen, Rotenberg and Rutschmann [SODA, 2024] who showed that every plane triangulation on $n > 10$ vertices has a dominating set of size at most $2n/7$. Our corollary improves their bound for $n$-vertex plane triangulations which contain a maximal independent set of size either less than $2n/7$ or more than $3n/7$. - 24 January 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring
- 24 January 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring
- 1 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 105 (1) , 68-77
Disjoint total dominating sets in near‐triangulations
We show that every simple planar near‐triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.
- 1 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 105 (1) , 68-77
Disjoint total dominating sets in near‐triangulations
We show that every simple planar near‐triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.
- Open Access
- 6 June 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 103 (4) , 603-605
Issue Information
- 6 June 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 103 (4) , 603-605
Open AccessIssue Information