D. Rajendraprasad

collaborators

4 papers

math.SP2025

Laplacian Spectrum and Domination in Trees

Deepak Rajendraprasad, Durga R. Sankaranarayanan

For a finite simple undirected graph $G$ , let $I^^{3} (G)$ denote the size of a smallest dominating set of $G$ and $I^¼ (G)$ denote the number of eigenvalues of the Laplacian matrix of $G…

math.CO2025

Multipacking in Hypercubes

Deepak Rajendraprasad, Varun Sani, Birenjith Sasidharan +1

For an undirected graph $G$ , a dominating broadcast on $G$ is a function $f : V (G) \to N$ such that for any vertex $u \in V (G)$ , there exists a vertex $v \in V (G)$ …

cs.DS2025

Color-Constrained Arborescences in Edge-Colored Digraphs

P. S. Ardra, Jasine Babu, R. Krithika +1

Given a multigraph $G$ whose edges are colored from the set $[q] := {1, 2, \dots, q}$ (\emph{ $q$ -colored graph}), and a vector $I^\pm = (I^\pm_{1}, \dots, I^\pm_{q}) \in N^{q}$ (\emph{col…

math.CO2024

Maximal Independent Sets in Planar Triangulations

P. Francis, Abraham M. Illickan, Lijo M. Jose +1

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…