Joe Ryan
Impact in
-
- Finite Group Theory Research
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- semigroups and automata theory
Papers in
-
- Graph Labeling and Dimension Problems 31
- Advanced Graph Theory Research 10
-
- graph theory and CDMA systems 11
- Co-authors
- Andrei Kelarev (5 shared papers)John Yearwood (1 shared paper)Mirka Miller (25 shared papers)Martin Bača (13 shared papers)Andrea Semaničová–Feňovčíková (10 shared papers)Kiki Ariyanti Sugeng (5 shared papers)Dafik Dafik (5 shared papers)Ljiljana Branković (3 shared papers)
In The Last Decade
Joe Ryan
47 papers receiving 415 citations
Peers
Comparison fields: 5 of 46
- Discrete Mathematics and Combinatorics 111
- Computational Theory and Mathematics 338
- Geometry and Topology 103
- Algebra and Number Theory 46
- Computer Networks and Communications 67
Countries citing papers authored by Joe Ryan
This map shows the geographic impact of Joe Ryan'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 Joe Ryan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joe Ryan more than expected).
Fields of papers citing papers by Joe Ryan
This network shows the impact of papers produced by Joe Ryan. 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 Joe Ryan. The network helps show where Joe Ryan may publish in the future.
Co-authors
The 25 scholars most cited alongside Joe Ryan, 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 55 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 152 | |
| 2 | 1997 | 18 | |
| 3 | 2018 | 17 | |
| 4 | 2017 | 17 | |
| 5 | On H-supermagic labelings for certain shackles and amalgamations of a connected graph | 2010 | 16 |
| 6 | On distance magic labeling of graphs | 2009 | 16 |
| 7 | 1998 | 12 | |
| 8 | 2015 | 12 | |
| 9 | Super edge-antimagic total labelings of mK n, n, n . | 2011 | 11 |
| 10 | 2012 | 11 | |
| 11 | 2008 | 10 | |
| 12 | Large graphs with small degree and diameter: a voltage assignment approach. | 1998 | 9 |
| 13 | 2014 | 9 | |
| 14 | 2014 | 9 | |
| 15 | 2007 | 8 | |
| 16 | 2015 | 8 | |
| 17 | 2006 | 8 | |
| 18 | 2014 | 8 | |
| 19 | Exclusive sum labeling of graphs | 2005 | 7 |
| 20 | 2018 | 7 |
About Joe Ryan
Joe Ryan is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Computer Networks and Communications, Geometry and Topology and Information Systems, having authored 55 papers that have together received 440 indexed citations. Recurring topics across this work include Graph Labeling and Dimension Problems (31 papers), graph theory and CDMA systems (11 papers), Interconnection Networks and Systems (11 papers), Advanced Graph Theory Research (10 papers), Graph theory and applications (5 papers), Health, Medicine and Society (3 papers), Cryptography and Data Security (3 papers) and Aging, Elder Care, and Social Issues (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (111 citations), Computational Theory and Mathematics (338 citations), Geometry and Topology (103 citations), Algebra and Number Theory (46 citations) and Computer Networks and Communications (67 citations). Joe Ryan has collaborated with scholars based in Australia, Czechia and Slovakia. Frequent co-authors include Andrei Kelarev, John Yearwood, Mirka Miller, Martin Bača, Andrea Semaničová–Feňovčíková, Kiki Ariyanti Sugeng, Dafik Dafik, Ljiljana Branković, Ján Plesnı́k and Slamin Slamin. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, Distributed and Parallel Databases and Journal of Combinatorial Optimization.
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.