Stephen C. Locke
- Computational Theory and Mathematics top 2%
- Discrete Mathematics and Combinatorics top 2%
- Geometry and Topology top 5%
- Electrical and Electronic Engineering
- Computer Networks and Communications top 10%
- Co-authors
- J. A. BondyKathryn FraughnaughDave WitteMichael O. AlbertsonStephen T. HedetniemiRobert E. JamisonBrian AlspachYoshimi Egawa
- Topics
- Advanced Graph Theory Research (23 papers)Limits and Structures in Graph Theory (17 papers)graph theory and CDMA systems (15 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- United StatesCanadaItaly
In The Last Decade
Stephen C. Locke
29 papers receiving 286 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 263
- Discrete Mathematics and Combinatorics 174
- Geometry and Topology 96
- Electrical and Electronic Engineering 96
- Computer Networks and Communications 60
Countries citing papers authored by Stephen C. Locke
This map shows the geographic impact of Stephen C. Locke'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 Stephen C. Locke with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephen C. Locke more than expected).
Fields of papers citing papers by Stephen C. Locke
This network shows the impact of papers produced by Stephen C. Locke. 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 Stephen C. Locke. The network helps show where Stephen C. Locke may publish in the future.
Co-authorship network of co-authors of Stephen C. Locke
This figure shows the co-authorship network connecting the top 25 collaborators of Stephen C. Locke. A scholar is included among the top collaborators of Stephen C. Locke 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 Stephen C. Locke. Stephen C. Locke is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 9 | |
| 2 | 1 | |
| 3 | 8 | |
| 4 | 7 | |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 10 | |
| 8 | Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles. | 4 |
| 9 | 5 | |
| 10 | 8 | |
| 11 | 6 | |
| 12 | 16 | |
| 13 | 4 | |
| 14 | 20 | |
| 15 | 20 | |
| 16 | 31 | |
| 17 | 55 | |
| 18 | 4 | |
| 19 | 28 | |
| 20 | 21 |
About Stephen C. Locke
Stephen C. Locke is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 32 papers that have together received 314 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (23 papers), Limits and Structures in Graph Theory (17 papers) and graph theory and CDMA systems (15 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (174 citations), Computational Theory and Mathematics (263 citations) and Geometry and Topology (96 citations). Stephen C. Locke has collaborated with scholars based in United States, Canada and Italy. Frequent co-authors include J. A. Bondy, Kathryn Fraughnaugh, Dave Witte, Michael O. Albertson, Stephen T. Hedetniemi, Robert E. Jamison, Brian Alspach, Yoshimi Egawa, Richard Stong and R.P. Anstee. Their work appears in journals such as American Mathematical Monthly, Discrete Mathematics and Journal of Combinatorial Theory Series B.
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.