Indra Rajasingh

527 total citations
37 papers, 349 citations indexed

About

Indra Rajasingh is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Indra Rajasingh has authored 37 papers receiving a total of 349 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Computer Networks and Communications, 19 papers in Computational Theory and Mathematics and 16 papers in Electrical and Electronic Engineering. Recurrent topics in Indra Rajasingh's work include Interconnection Networks and Systems (33 papers), Advanced Graph Theory Research (17 papers) and Graph theory and applications (11 papers). Indra Rajasingh is often cited by papers focused on Interconnection Networks and Systems (33 papers), Advanced Graph Theory Research (17 papers) and Graph theory and applications (11 papers). Indra Rajasingh collaborates with scholars based in India, Kuwait and Australia. Indra Rajasingh's co-authors include Bharati Rajan, Paul Manuel, Micheal Arockiaraj, R. Sundara Rajan, Rakesh Bharati, S. Raja, S. Arumugam, Saeed Kosari, Hossein Rashmanlou and Yongsheng Rao and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Information Processing Letters.

In The Last Decade

Indra Rajasingh

32 papers receiving 305 citations

Peers

Indra Rajasingh
Indra Rajasingh
Citations per year, relative to Indra Rajasingh Indra Rajasingh (= 1×) peers Junming Xu

Countries citing papers authored by Indra Rajasingh

Since Specialization
Citations

This map shows the geographic impact of Indra Rajasingh'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 Indra Rajasingh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Indra Rajasingh more than expected).

Fields of papers citing papers by Indra Rajasingh

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Indra Rajasingh. 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 Indra Rajasingh. The network helps show where Indra Rajasingh may publish in the future.

Co-authorship network of co-authors of Indra Rajasingh

This figure shows the co-authorship network connecting the top 25 collaborators of Indra Rajasingh. A scholar is included among the top collaborators of Indra Rajasingh 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 Indra Rajasingh. Indra Rajasingh 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.
Raja, S., et al.. (2021). Induced H-packing k-partition of graphs. 6(2). 143–158. 2 indexed citations
2.
Rajasingh, Indra, et al.. (2020). Embedding of Complete graphs and Cycles into Grids with holes. Procedia Computer Science. 172. 115–121. 1 indexed citations
3.
Rajasingh, Indra & R. Sundara Rajan. (2017). Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs.. Ars Combinatoria. 130. 215–237. 4 indexed citations
4.
Rajasingh, Indra, et al.. (2017). Embedding complete bipartite graph into grid with optimum congestion and wirelength. International Journal of Networking and Virtual Organisations. 17(1). 64–64. 2 indexed citations
5.
Rajasingh, Indra, et al.. (2017). Embedding complete bipartite graph into grid with optimum congestion and wirelength. International Journal of Networking and Virtual Organisations. 17(1). 64–64. 3 indexed citations
6.
Rajasingh, Indra, et al.. (2016). POWER DOMINATION PARAMETERS IN HYPERMESH-PYRAMID NETWORKS AND CORONA GRAPHS. 109(5). 59.
7.
Arockiaraj, Micheal, et al.. (2015). Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees. Discrete Optimization. 17. 1–13. 10 indexed citations
8.
Rajasingh, Indra, et al.. (2015). Improved Bounds on Forwarding Index of Networks. Procedia Computer Science. 57. 592–595. 1 indexed citations
9.
Rajasingh, Indra, et al.. (2015). Bothway embedding of circulant network into grid. Journal of Discrete Algorithms. 33. 2–9. 4 indexed citations
10.
Arockiaraj, Micheal, et al.. (2014). Embedding of hypercubes into sibling trees. Discrete Applied Mathematics. 169. 9–14. 4 indexed citations
11.
Rajasingh, Indra, et al.. (2014). Excessive index for mesh derived networks. Journal of Discrete Algorithms. 33. 43–48. 1 indexed citations
12.
Rajasingh, Indra, et al.. (2013). On excessive index of certain networks. Theoretical Computer Science. 501. 34–40. 4 indexed citations
13.
Rajan, R. Sundara, et al.. (2013). EMBEDDING OF CIRCULANT NETWORKS INTO $k$-ROOTED SIBLING TREES. 86(6). 1005–1012. 3 indexed citations
14.
Manuel, Paul & Indra Rajasingh. (2011). Minimum Metric Dimension of Silicate Networks.. Ars Combinatoria. 98. 501–510. 15 indexed citations
15.
Arockiaraj, Micheal, Paul Manuel, Indra Rajasingh, & Bharati Rajan. (2011). Wirelength of 1-fault hamiltonian graphs into wheels and fans. Information Processing Letters. 111(18). 921–925. 20 indexed citations
16.
Manuel, Paul, Micheal Arockiaraj, Indra Rajasingh, & Bharati Rajan. (2011). Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discrete Applied Mathematics. 159(17). 2109–2116. 32 indexed citations
17.
Rajasingh, Indra, Paul Manuel, Bharati Rajan, & Micheal Arockiaraj. (2011). Wirelength of hypercubes into certain trees. Discrete Applied Mathematics. 160(18). 2778–2786. 19 indexed citations
18.
Rajasingh, Indra, et al.. (2009). Feedback Arc Set in Oriented Graphs. 59. 569–573. 1 indexed citations
19.
Manuel, Paul, et al.. (2008). Exact wirelength of hypercubes on a grid. Discrete Applied Mathematics. 157(7). 1486–1495. 68 indexed citations
20.
Manuel, Paul, et al.. (2006). On Induced Matching Partitions of Certain Interconnection Networks.. 57–63. 2 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