Mark N. Ellingham
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 41
- Graph Labeling and Dimension Problems 12
-
- Limits and Structures in Graph Theory 12
- Finite Group Theory Research 7
- Co-authors
- Simon J. Broughton (2 shared papers)Luis Goddyn (1 shared paper)Diane Stephens (2 shared papers)Zhicheng Gao (2 shared papers)Yair Caro (1 shared paper)Joseph D. Horton (1 shared paper)Gordon Royle (2 shared papers)David H. J. Bunka (1 shared paper)
- Journals
- Journal of Graph Theory (14 papers)Journal of Combinatorial Theory Series B (10 papers)Discrete Mathematics (5 papers)Graphs and Combinatorics (3 papers)Journal of Combinatorial Designs (2 papers)
- Partner nations
- United StatesCanadaJapan
In The Last Decade
Mark N. Ellingham
56 papers receiving 494 citations
Peers
Comparison fields: 5 of 71
- Discrete Mathematics and Combinatorics 178
- Computational Theory and Mathematics 400
- Geometry and Topology 201
- Music 59
- Computer Graphics and Computer-Aided Design 42
Countries citing papers authored by Mark N. Ellingham
This map shows the geographic impact of Mark N. Ellingham'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 Mark N. Ellingham with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark N. Ellingham more than expected).
Fields of papers citing papers by Mark N. Ellingham
This network shows the impact of papers produced by Mark N. Ellingham. 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 Mark N. Ellingham. The network helps show where Mark N. Ellingham may publish in the future.
Co-authors
The 25 scholars most cited alongside Mark N. Ellingham, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 62 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | World music : the rough guide | 1999 | 76 |
| 2 | Basic subgraphs and graph spectra. | 1993 | 57 |
| 3 | 2000 | 48 | |
| 4 | 1996 | 37 | |
| 5 | 1998 | 26 | |
| 6 | 2000 | 24 | |
| 7 | 2006 | 21 | |
| 8 | 1995 | 18 | |
| 9 | 2001 | 16 | |
| 10 | 1983 | 15 | |
| 11 | 1994 | 14 | |
| 12 | 1984 | 14 | |
| 13 | 2007 | 13 | |
| 14 | 2005 | 12 | |
| 15 | A Characterization of Well-covered Cubic Graphs | 1993 | 11 |
| 16 | 2008 | 11 | |
| 17 | 1988 | 10 | |
| 18 | 1997 | 10 | |
| 19 | 1988 | 9 | |
| 20 | 1987 | 9 |
About Mark N. Ellingham
Mark N. Ellingham is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computer Networks and Communications, having authored 62 papers that have together received 576 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (41 papers), graph theory and CDMA systems (16 papers), Interconnection Networks and Systems (13 papers), Graph Labeling and Dimension Problems (12 papers), Limits and Structures in Graph Theory (12 papers), Graph theory and applications (9 papers), Computational Geometry and Mesh Generation (9 papers) and Finite Group Theory Research (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (178 citations), Computational Theory and Mathematics (400 citations), Geometry and Topology (201 citations), Music (59 citations) and Computer Graphics and Computer-Aided Design (42 citations). Mark N. Ellingham has collaborated with scholars based in United States, Canada and Japan. Frequent co-authors include Simon J. Broughton, Luis Goddyn, Diane Stephens, Zhicheng Gao, Yair Caro, Joseph D. Horton, Gordon Royle, David H. J. Bunka, N. C. Wormald and Derek Holton. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Mathematics, Graphs and Combinatorics and Journal of Combinatorial Designs.
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.