E. Sampathkumar
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 25
- Graph Labeling and Dimension Problems 24
-
- Limits and Structures in Graph Theory 10
- Co-authors
- Csilla Bujtás (4 shared papers)Źsolt Tuza (3 shared papers)B. D. Acharya (2 shared papers)S. Arumugam (1 shared paper)Chandrashekar Adiga (2 shared papers)Manjunath Siddaiah‐Subramanya (1 shared paper)S. Pirzada (1 shared paper)Zs. Tuza (1 shared paper)
- Journals
- Discrete Mathematics (8 papers)Graphs and Combinatorics (2 papers)Journal of Combinatorial Theory Series B (1 paper)Journal of Graph Theory (1 paper)Discrete Applied Mathematics (1 paper)
- Partner nations
- IndiaHungaryUnited States
In The Last Decade
E. Sampathkumar
30 papers receiving 210 citations
Peers
Comparison fields: 5 of 35
- Discrete Mathematics and Combinatorics 52
- Computational Theory and Mathematics 236
- Geometry and Topology 67
- Computer Networks and Communications 38
- Management Science and Operations Research 13
Countries citing papers authored by E. Sampathkumar
This map shows the geographic impact of E. Sampathkumar'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 E. Sampathkumar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. Sampathkumar more than expected).
Fields of papers citing papers by E. Sampathkumar
This network shows the impact of papers produced by E. Sampathkumar. 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 E. Sampathkumar. The network helps show where E. Sampathkumar may publish in the future.
Co-authors
The 12 scholars most cited alongside E. Sampathkumar, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 33 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | The global domination number of a graph | 1989 | 53 |
| 2 | 1996 | 51 | |
| 3 | 1997 | 15 | |
| 4 | Point set domination number of a graph | 1993 | 15 |
| 5 | 1975 | 14 | |
| 6 | 2010 | 12 | |
| 7 | 2011 | 9 | |
| 8 | 1989 | 9 | |
| 9 | Mixed domination in graphs | 1992 | 8 |
| 10 | 1976 | 8 | |
| 11 | Color energy of a graph | 2013 | 7 |
| 12 | Domination and neighbourhood critical, fixed, free and totally free points | 1992 | 7 |
| 13 | 1994 | 6 | |
| 14 | 2010 | 6 | |
| 15 | 2014 | 6 | |
| 16 | 1993 | 5 | |
| 17 | 2011 | 5 | |
| 18 | 2010 | 4 | |
| 19 | 1998 | 4 | |
| 20 | 1990 | 4 |
About E. Sampathkumar
E. Sampathkumar is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 33 papers that have together received 263 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (24 papers), Limits and Structures in Graph Theory (10 papers), Graph theory and applications (7 papers), graph theory and CDMA systems (7 papers), Nuclear Receptors and Signaling (3 papers), Digital Image Processing Techniques (2 papers) and Rings, Modules, and Algebras (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (52 citations), Computational Theory and Mathematics (236 citations), Geometry and Topology (67 citations), Computer Networks and Communications (38 citations) and Management Science and Operations Research (13 citations). E. Sampathkumar has collaborated with scholars based in India, Hungary and United States. Frequent co-authors include Csilla Bujtás, Źsolt Tuza, B. D. Acharya, S. Arumugam, Chandrashekar Adiga, Manjunath Siddaiah‐Subramanya, S. Pirzada, Zs. Tuza, Sukhamay Kundu and S. B. Rao. Their work appears in journals such as Discrete Mathematics, Graphs and Combinatorics, Journal of Combinatorial Theory Series B, Journal of Graph Theory and Discrete Applied Mathematics.
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.