This map shows the geographic impact of S. Arumugam'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 S. Arumugam with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Arumugam more than expected).
This network shows the impact of papers produced by S. Arumugam. 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 S. Arumugam. The network helps show where S. Arumugam may publish in the future.
Co-authorship network of co-authors of S. Arumugam
This figure shows the co-authorship network connecting the top 25 collaborators of S. Arumugam.
A scholar is included among the top collaborators of S. Arumugam 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 S. Arumugam. S. Arumugam is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Arumugam, S., et al.. (2020). Mean labelings of cyclic snakes. AKCE International Journal of Graphs and Combinatorics.
4.
Galeana‐Sánchez, Hortensia, et al.. (2020). On the existence of (k, l)-kernels in digraphs with a given circumference. AKCE International Journal of Graphs and Combinatorics.2 indexed citations
5.
Arumugam, S., et al.. (2020). Distance magic graphs of high regularity. AKCE International Journal of Graphs and Combinatorics.1 indexed citations
6.
Blidia, Mostafa, et al.. (2020). Vertices contained in all or in no minimum k-dominating sets of a tree. AKCE International Journal of Graphs and Combinatorics.
Koh, K.M., et al.. (2020). A note on Power Domination Problem in Diameter Two Graphs. AKCE International Journal of Graphs and Combinatorics.
9.
Arumugam, S., et al.. (2012). Minimal dominating sets in maximum domatic partitions.. Australas. J Comb.. 52. 281–292.3 indexed citations
10.
Arumugam, S., et al.. (2012). On (a, d)-distance antimagic graphs.. NOVA (University of Newcastle Australia). 54. 279–288.18 indexed citations
11.
Sheikholeslami, Seyed Mahmoud, et al.. (2012). The distance Roman domatic number of a graph. AKCE International Journal of Graphs and Combinatorics. 9(2). 205–212.1 indexed citations
12.
Arumugam, S., et al.. (2009). A Note On Global Domination In Graphs.. Ars Combinatoria. 93.3 indexed citations
Arumugam, S., Gary S. Bloom, Mirka Miller, & Joe Ryan. (2009). Some open problems on graph labelings. AKCE International Journal of Graphs and Combinatorics. 10(2). 237–243.1 indexed citations
15.
Arumugam, S., et al.. (2007). Simple acyclic graphoidal covers in a graph.. Australas. J Comb.. 37. 243–256.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.