R. C. Entringer
- Geometry and Topology top 0.2%
- Computational Theory and Mathematics top 0.2%
- Organic Chemistry top 5%
- Discrete Mathematics and Combinatorics top 1%
- Computer Networks and Communications top 5%
- Co-authors
- İvan GutmanAndrey A. DobryninDennis JacksonDavid A. SnyderLane ClarkŁászló A. SzékelyPeter DankelmannP.J.B. Slater
- Topics
- Advanced Graph Theory Research (28 papers)Limits and Structures in Graph Theory (14 papers)Graph theory and applications (14 papers)
- Cited by
- Geometry and TopologyDiscrete Mathematics and CombinatoricsComputational Theory and Mathematics
- Journals
- Journal of the Franklin InstituteAmerican Mathematical MonthlyProceedings of the American Mathematical Society
- Partner nations
- United StatesHungarySouth Africa
In The Last Decade
R. C. Entringer
50 papers receiving 1.4k citations
Hit Papers
Peers
Comparison fields: 5 of 68
- Geometry and Topology 1.2k
- Computational Theory and Mathematics 1.2k
- Organic Chemistry 465
- Discrete Mathematics and Combinatorics 348
- Computer Networks and Communications 166
Countries citing papers authored by R. C. Entringer
This map shows the geographic impact of R. C. Entringer'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 R. C. Entringer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites R. C. Entringer more than expected).
Fields of papers citing papers by R. C. Entringer
This network shows the impact of papers produced by R. C. Entringer. 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 R. C. Entringer. The network helps show where R. C. Entringer may publish in the future.
Co-authorship network of co-authors of R. C. Entringer
This figure shows the co-authorship network connecting the top 25 collaborators of R. C. Entringer. A scholar is included among the top collaborators of R. C. Entringer 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 R. C. Entringer. R. C. Entringer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 28 | |
| 2 | 20 | |
| 3 | ON THE WIENER INDEX OF TREES FROM CERTAIN FAMILIES | 26 |
| 4 | 1 | |
| 5 | 24 | |
| 6 | Extremal problems for local properties of graphs. | 9 |
| 7 | 5 | |
| 8 | 20 | |
| 9 | 24 | |
| 10 | 259 | |
| 11 | 2 | |
| 12 | 1 | |
| 13 | 47 | |
| 14 | 8 | |
| 15 | 22 | |
| 16 | 1 | |
| 17 | 3 | |
| 18 | 2 | |
| 19 | 8 | |
| 20 | 1 |
About R. C. Entringer
R. C. Entringer is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 52 papers that have together received 1.6k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (28 papers), Limits and Structures in Graph Theory (14 papers) and Graph theory and applications (14 papers). The work is most often cited by research in Geometry and Topology (1.2k citations), Discrete Mathematics and Combinatorics (348 citations) and Computational Theory and Mathematics (1.2k citations). R. C. Entringer has collaborated with scholars based in United States, Hungary and South Africa. Frequent co-authors include İvan Gutman, Andrey A. Dobrynin, Dennis Jackson, David A. Snyder, Lane Clark, Łászló A. Székely, Peter Dankelmann, P.J.B. Slater, Henda C. Swart and Peter R. Slater. Their work appears in journals such as Journal of the Franklin Institute, American Mathematical Monthly and Proceedings of the American Mathematical Society.
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.