E. Sampathkumar
-
- Limits and Structures in Graph Theory 9
-
- Advanced Graph Theory Research 24
- Graph Labeling and Dimension Problems 23
- Geometry and Topology top 10%
- Graph theory and applications 7
-
- graph theory and CDMA systems 6
-
- Nuclear Receptors and Signaling 3
-
- Digital Image Processing Techniques 2
-
- Functional Equations Stability Results 1
- Co-authors
- Csilla BujtásŹsolt TuzaB. D. AcharyaS. ArumugamChandrashekar AdigaManjunath Siddaiah‐SubramanyaSukhamay KunduZs. Tuza
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Discrete Mathematics (8 papers)Graphs and Combinatorics (2 papers)Journal of Combinatorial Theory Series B (1 paper)
- Partner nations
- IndiaHungaryUnited States
In The Last Decade
E. Sampathkumar
28 papers receiving 188 citations
Peers
Comparison fields: 5 of 32
- Discrete Mathematics and Combinatorics 52
- Computational Theory and Mathematics 217
- Geometry and Topology 60
- Computer Networks and Communications 34
- Management Science and Operations Research 12
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 6 | |
| 2 | Color energy of a graph | 2013 | 6 |
| 3 | Coloring of signed graphs. | 2013 | 2 |
| 4 | 2011 | 5 | |
| 5 | 2011 | 9 | |
| 6 | The 1-open neighborhood edge coloring number of a graph | 2011 | 0 |
| 7 | 2010 | 5 | |
| 8 | 2010 | 12 | |
| 9 | Jump symmetric n-sigraphs | 2008 | 2 |
| 10 | 2003 | 1 | |
| 11 | 1998 | 2 | |
| 12 | 1997 | 13 | |
| 13 | Reconstruction of a graph of order p from its (p-1)-complements | 1996 | 1 |
| 14 | 1996 | 47 | |
| 15 | Semi strong chromatic number of a graph | 1995 | 0 |
| 16 | 1993 | 5 | |
| 17 | Point set domination number of a graph | 1993 | 14 |
| 18 | 1990 | 3 | |
| 19 | 1976 | 3 | |
| 20 | 1975 | 13 |
About E. Sampathkumar
E. Sampathkumar is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Algebra and Number Theory and Cellular and Molecular Neuroscience, having authored 31 papers that have together received 241 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (24 papers), Graph Labeling and Dimension Problems (23 papers), Limits and Structures in Graph Theory (9 papers), Graph theory and applications (7 papers), graph theory and CDMA systems (6 papers), Nuclear Receptors and Signaling (3 papers), Digital Image Processing Techniques (2 papers) and Functional Equations Stability Results (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (52 citations), Computational Theory and Mathematics (217 citations), Geometry and Topology (60 citations), Computer Networks and Communications (34 citations) and Management Science and Operations Research (12 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, Sukhamay Kundu, Zs. Tuza, S. Pirzada and James B. Shearer. 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.