Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Resolvability in graphs and the metric dimension of a graph
2000638 citationsGary Chartrand, Linda Eroh et al.Discrete Applied Mathematicsprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
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).
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.
Eroh, Linda & Ralucca Gera. (2008). Global Alliance Partition in Trees. Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School).8 indexed citations
Eroh, Linda & Ortrud R. Oellermann. (2003). Bipartite rainbow Ramsey numbers. Discrete Mathematics. 277(1-3). 57–72.11 indexed citations
16.
Chartrand, Gary, Linda Eroh, Frank Harary, & Ping Zhang. (2000). How large can the domination numbers of a graph be. The Australasian Journal of Combinatorics. 21. 23–35.1 indexed citations
17.
Chartrand, Gary, Linda Eroh, Mark A. Johnson, & Ortrud R. Oellermann. (2000). Resolvability in graphs and the metric dimension of a graph. Discrete Applied Mathematics. 105(1-3). 99–113.638 indexed citations breakdown →
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.