Deepak Rajendraprasad

448 total citations
24 papers, 172 citations indexed

About

Deepak Rajendraprasad is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Deepak Rajendraprasad has authored 24 papers receiving a total of 172 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 10 papers in Discrete Mathematics and Combinatorics and 6 papers in Computer Networks and Communications. Recurrent topics in Deepak Rajendraprasad's work include Advanced Graph Theory Research (21 papers), Graph Labeling and Dimension Problems (12 papers) and Limits and Structures in Graph Theory (10 papers). Deepak Rajendraprasad is often cited by papers focused on Advanced Graph Theory Research (21 papers), Graph Labeling and Dimension Problems (12 papers) and Limits and Structures in Graph Theory (10 papers). Deepak Rajendraprasad collaborates with scholars based in India, Israel and Canada. Deepak Rajendraprasad's co-authors include L. Sunil Chandran, Manu Basavaraju, Rogers Mathew, Xueliang Li, Martin Charles Golumbic, Ilan Newman, Christian Sohler, Yuri Rabinovich, Wilfried Imrich and Noga Alon and has published in prestigious journals such as Journal of Computer and System Sciences, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Deepak Rajendraprasad

22 papers receiving 164 citations

Peers

Deepak Rajendraprasad
Konrad K. Dabrowski United Kingdom
Deepak Rajendraprasad
Citations per year, relative to Deepak Rajendraprasad Deepak Rajendraprasad (= 1×) peers Konrad K. Dabrowski

Countries citing papers authored by Deepak Rajendraprasad

Since Specialization
Citations

This map shows the geographic impact of Deepak Rajendraprasad's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Deepak Rajendraprasad with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Deepak Rajendraprasad more than expected).

Fields of papers citing papers by Deepak Rajendraprasad

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Deepak Rajendraprasad. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Deepak Rajendraprasad. The network helps show where Deepak Rajendraprasad may publish in the future.

Co-authorship network of co-authors of Deepak Rajendraprasad

This figure shows the co-authorship network connecting the top 25 collaborators of Deepak Rajendraprasad. A scholar is included among the top collaborators of Deepak Rajendraprasad based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Deepak Rajendraprasad. Deepak Rajendraprasad is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Rajendraprasad, Deepak, et al.. (2024). Packing arc-disjoint cycles in oriented graphs. Journal of Computer and System Sciences. 143. 103530–103530.
2.
Rajendraprasad, Deepak, et al.. (2023). Disjoint total dominating sets in near‐triangulations. Journal of Graph Theory. 105(1). 68–77. 1 indexed citations
3.
Rajendraprasad, Deepak, et al.. (2023). On Domatic and Total Domatic Numbers of Cartesian Products of Graphs. Bulletin of the Malaysian Mathematical Sciences Society. 46(3). 1 indexed citations
4.
Rajendraprasad, Deepak, et al.. (2023). Improved bounds for the oriented radius of mixed multigraphs. Journal of Graph Theory. 103(4). 674–689. 1 indexed citations
5.
Rajendraprasad, Deepak, et al.. (2021). An improvement to Chvátal and Thomassen’s upper bound for oriented diameter. Discrete Applied Mathematics. 304. 432–440. 5 indexed citations
6.
Newman, Ilan, Yuri Rabinovich, Deepak Rajendraprasad, & Christian Sohler. (2019). Testing for forbidden order patterns in an array. Random Structures and Algorithms. 55(2). 402–426. 3 indexed citations
7.
Alon, Noga, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, & Deepak Rajendraprasad. (2018). Separation dimension and sparsity. Journal of Graph Theory. 89(1). 14–25. 2 indexed citations
8.
Newman, Ilan, Yuri Rabinovich, Deepak Rajendraprasad, & Christian Sohler. (2017). Testing for Forbidden Order Patterns in an Array. 1582–1597. 3 indexed citations
9.
Golumbic, Martin Charles, et al.. (2017). Edge-intersection graphs of boundary-generated paths in a grid. Discrete Applied Mathematics. 236. 214–222. 3 indexed citations
10.
Chandran, L. Sunil, Rogers Mathew, & Deepak Rajendraprasad. (2015). Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. Discrete Mathematics. 339(2). 443–446. 1 indexed citations
11.
Chandran, L. Sunil, et al.. (2015). Rainbow colouring of split graphs. Discrete Applied Mathematics. 216. 98–113. 2 indexed citations
12.
Chandran, L. Sunil, et al.. (2015). Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. European Journal of Combinatorics. 48. 110–126. 2 indexed citations
13.
Chandran, L. Sunil, Wilfried Imrich, Rogers Mathew, & Deepak Rajendraprasad. (2015). Boxicity and cubicity of product graphs. European Journal of Combinatorics. 48. 100–109. 3 indexed citations
14.
Basavaraju, Manu, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, & Deepak Rajendraprasad. (2015). Separation Dimension of Graphs and Hypergraphs. Algorithmica. 75(1). 187–204. 4 indexed citations
15.
Alon, Noga, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, & Deepak Rajendraprasad. (2015). Separation Dimension of Bounded Degree Graphs. SIAM Journal on Discrete Mathematics. 29(1). 59–64. 5 indexed citations
16.
Janssen, Jeannette, Rogers Mathew, & Deepak Rajendraprasad. (2015). Partial List Colouring of Certain Graphs. The Electronic Journal of Combinatorics. 22(3).
17.
Basavaraju, Manu, et al.. (2013). Rainbow Connection Number of Graph Power and Graph Products. Graphs and Combinatorics. 30(6). 1363–1382. 14 indexed citations
18.
Basavaraju, Manu, et al.. (2012). Rainbow Connection Number and Radius. Graphs and Combinatorics. 30(2). 275–285. 25 indexed citations
19.
Chandran, L. Sunil, et al.. (2011). Rainbow connection number and connected dominating sets. Journal of Graph Theory. 71(2). 206–218. 58 indexed citations
20.
Chandran, L. Sunil, et al.. (2011). Rainbow Connection Number and Connected Dominating Sets. Electronic Notes in Discrete Mathematics. 38. 239–244. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026