M. 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 38
- Graph Labeling and Dimension Problems 11
-
- Limits and Structures in Graph Theory 11
- Finite Group Theory Research 7
- Co-authors
- Simon Broughton (2 shared papers)Luis Goddyn (1 shared paper)Diane Stephens (2 shared papers)Zhicheng Gao (2 shared papers)Joseph D. Horton (1 shared paper)Yair Caro (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 (9 papers)Discrete Mathematics (5 papers)Graphs and Combinatorics (3 papers)European Journal of Combinatorics (2 papers)
- Partner nations
- United StatesCanadaJapan
In The Last Decade
M. N. Ellingham
52 papers receiving 454 citations
Peers
Comparison fields: 5 of 68
- Discrete Mathematics and Combinatorics 160
- Computational Theory and Mathematics 362
- Geometry and Topology 182
- Music 40
- Computer Graphics and Computer-Aided Design 41
Countries citing papers authored by M. N. Ellingham
This map shows the geographic impact of M. 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 M. 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 M. N. Ellingham more than expected).
Fields of papers citing papers by M. N. Ellingham
This network shows the impact of papers produced by M. 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 M. N. Ellingham. The network helps show where M. N. Ellingham may publish in the future.
Co-authors
The 25 scholars most cited alongside M. 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 59 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Basic subgraphs and graph spectra. | 1993 | 56 |
| 2 | World music : the rough guide | 1999 | 54 |
| 3 | 2000 | 45 | |
| 4 | 1996 | 32 | |
| 5 | 2000 | 23 | |
| 6 | 1998 | 23 | |
| 7 | 2006 | 19 | |
| 8 | 1995 | 17 | |
| 9 | 1983 | 16 | |
| 10 | 2001 | 14 | |
| 11 | 1994 | 14 | |
| 12 | 1984 | 13 | |
| 13 | A Characterization of Well-covered Cubic Graphs | 1993 | 12 |
| 14 | 2005 | 12 | |
| 15 | 2007 | 12 | |
| 16 | 2008 | 11 | |
| 17 | 1997 | 10 | |
| 18 | 1988 | 9 | |
| 19 | 1987 | 8 | |
| 20 | 1988 | 7 |
About M. N. Ellingham
M. N. Ellingham is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 59 papers that have together received 505 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (38 papers), graph theory and CDMA systems (14 papers), Interconnection Networks and Systems (13 papers), Graph Labeling and Dimension Problems (11 papers), Limits and Structures in Graph Theory (11 papers), Computational Geometry and Mesh Generation (9 papers), Graph theory and applications (8 papers) and Finite Group Theory Research (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (160 citations), Computational Theory and Mathematics (362 citations), Geometry and Topology (182 citations), Music (40 citations) and Computer Graphics and Computer-Aided Design (41 citations). M. N. Ellingham has collaborated with scholars based in United States, Canada and Japan. Frequent co-authors include Simon Broughton, Luis Goddyn, Diane Stephens, Zhicheng Gao, Joseph D. Horton, Yair Caro, Gordon Royle, David H. J. Bunka, Nicola J. Stonehouse and David J. Rowlands. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Mathematics, Graphs and Combinatorics and European Journal of Combinatorics.
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.