P. Paulraja
About
In The Last Decade
P. Paulraja
39 papers receiving 240 citations
Peers
Comparison fields: 5 of 23
- Computational Theory and Mathematics 199
- Electrical and Electronic Engineering 133
- Geometry and Topology 102
- Artificial Intelligence 91
- Discrete Mathematics and Combinatorics 74
Countries citing papers authored by P. Paulraja
This map shows the geographic impact of P. Paulraja'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 P. Paulraja with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites P. Paulraja more than expected).
Fields of papers citing papers by P. Paulraja
This network shows the impact of papers produced by P. Paulraja. 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 P. Paulraja. The network helps show where P. Paulraja may publish in the future.
Co-authorship network of co-authors of P. Paulraja
This figure shows the co-authorship network connecting the top 25 collaborators of P. Paulraja. A scholar is included among the top collaborators of P. Paulraja 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 P. Paulraja. P. Paulraja is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Decompositions of some classes of regular graphs and digraphs into cycles of length 4p. | 1 |
| 2 | Decompositions of complete equipartite graphs into cycles of lengths 3 and 6. | 1 |
| 3 | 2 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 3 | |
| 7 | 13 | |
| 8 | Directed Hamilton cycle decompositions of the tensor product of symmetric digraphs. | 2 |
| 9 | 6 | |
| 10 | 26 | |
| 11 | On Optimal Orientations Of Tensor Product Of Graphs And Circulant Graphs. | 4 |
| 12 | On Optimal Orientations Of Tensor Product Of Complete Graphs. | 4 |
| 13 | C 5 -decompositions of the tensor product of complete graphs. | 11 |
| 14 | 25 | |
| 15 | Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph. | 6 |
| 16 | Independent Sets And Matchings In Tensor Product Of Graphs. | 1 |
| 17 | 11 | |
| 18 | 2 | |
| 19 | 8 | |
| 20 | 4 |
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.