Linda Eroh
- Computational Theory and Mathematics top 0.5%
- Geometry and Topology top 2%
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- Ortrud R. OellermannGary ChartrandMark A. JohnsonRalucca GeraEunjeong YiMichelle SchultzFrank HararyPing Zhang
- Topics
- Graph Labeling and Dimension Problems (14 papers)Advanced Graph Theory Research (11 papers)Graph theory and applications (6 papers)
- Cited by
- Computational Theory and MathematicsGeometry and TopologyDiscrete Mathematics and Combinatorics
- Partner nations
- United StatesCanada
In The Last Decade
Linda Eroh
14 papers receiving 653 citations
Hit Papers
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 688
- Geometry and Topology 232
- Electrical and Electronic Engineering 204
- Computer Networks and Communications 40
- Discrete Mathematics and Combinatorics 37
Countries citing papers authored by Linda Eroh
This map shows the geographic impact of Linda Eroh'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 Linda Eroh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Linda Eroh more than expected).
Fields of papers citing papers by Linda Eroh
This network shows the impact of papers produced by Linda Eroh. 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 Linda Eroh. The network helps show where Linda Eroh may publish in the future.
Co-authorship network of co-authors of Linda Eroh
This figure shows the co-authorship network connecting the top 25 collaborators of Linda Eroh. A scholar is included among the top collaborators of Linda Eroh 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 Linda Eroh. Linda Eroh is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 7 | |
| 3 | 11 | |
| 4 | 0 | |
| 5 | 0 | |
| 6 | Alliance Partition Number in Graphs | 7 |
| 7 | A comparison between the Metric Dimension and Zero Forcing Number of Line Graphs | 4 |
| 8 | 2 | |
| 9 | 0 | |
| 10 | 0 | |
| 11 | 1 | |
| 12 | 0 | |
| 13 | Global Alliance Partition in Trees | 8 |
| 14 | 7 | |
| 15 | 11 | |
| 16 | How large can the domination numbers of a graph be | 1 |
| 17 | Resolvability in graphs and the metric dimension of a graphbreakdown → | 638 |
| 18 | Rainbow Ramsey Numbers | 4 |
| 19 | 4 | |
| 20 | Matching graphs | 6 |
About Linda Eroh
Linda Eroh is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 20 papers that have together received 711 indexed citations. Recurring topics across this work include Graph Labeling and Dimension Problems (14 papers), Advanced Graph Theory Research (11 papers) and Graph theory and applications (6 papers). The work is most often cited by research in Computational Theory and Mathematics (688 citations), Geometry and Topology (232 citations) and Discrete Mathematics and Combinatorics (37 citations). Linda Eroh has collaborated with scholars based in United States and Canada. Frequent co-authors include Ortrud R. Oellermann, Gary Chartrand, Mark A. Johnson, Ralucca Gera, Eunjeong Yi, Michelle Schultz, Frank Harary, Ping Zhang and Garry L. Johns. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Graph Theory.
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.