Darryn Bryant
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
Papers in
-
- graph theory and CDMA systems 111
-
- Finite Group Theory Research 36
- Limits and Structures in Graph Theory 22
- Co-authors
- Peter D. Adams (37 shared papers)Daniel Horsley (16 shared papers)Abdollah Khodkar (11 shared papers)Bronwyn J. Battersby (3 shared papers)Matt Trau (2 shared papers)C. A. Rodger (9 shared papers)Jonathan M. Keith (8 shared papers)Peter Danziger (4 shared papers)
- Journals
- Discrete Mathematics (15 papers)Journal of Combinatorial Designs (15 papers)Journal of Graph Theory (8 papers)Journal of Combinatorial Theory Series A (8 papers)Graphs and Combinatorics (7 papers)
- Partner nations
- AustraliaUnited StatesCanada
In The Last Decade
Darryn Bryant
122 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 79
- Discrete Mathematics and Combinatorics 484
- Computational Theory and Mathematics 404
- Electrical and Electronic Engineering 863
- Geometry and Topology 102
- Artificial Intelligence 398
Countries citing papers authored by Darryn Bryant
This map shows the geographic impact of Darryn Bryant'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 Darryn Bryant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Darryn Bryant more than expected).
Fields of papers citing papers by Darryn Bryant
This network shows the impact of papers produced by Darryn Bryant. 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 Darryn Bryant. The network helps show where Darryn Bryant may publish in the future.
Co-authors
The 25 scholars most cited alongside Darryn Bryant, 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 134 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2000 | 134 | |
| 2 | 1998 | 59 | |
| 3 | 2000 | 44 | |
| 4 | 2006 | 44 | |
| 5 | 2007 | 43 | |
| 6 | 1996 | 37 | |
| 7 | 2002 | 35 | |
| 8 | 2004 | 32 | |
| 9 | 2010 | 31 | |
| 10 | 2009 | 29 | |
| 11 | 2003 | 28 | |
| 12 | 2007 | 26 | |
| 13 | 2002 | 25 | |
| 14 | 2008 | 24 | |
| 15 | 2013 | 23 | |
| 16 | 2002 | 22 | |
| 17 | 2010 | 21 | |
| 18 | 2002 | 20 | |
| 19 | 2008 | 16 | |
| 20 | 2009 | 16 |
About Darryn Bryant
Darryn Bryant is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology, having authored 134 papers that have together received 1.2k indexed citations. Recurring topics across this work include graph theory and CDMA systems (111 papers), Finite Group Theory Research (36 papers), Coding theory and cryptography (34 papers), Advanced Graph Theory Research (32 papers), Graph Labeling and Dimension Problems (23 papers), Limits and Structures in Graph Theory (22 papers), Mathematics and Applications (11 papers) and semigroups and automata theory (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (484 citations), Computational Theory and Mathematics (404 citations), Electrical and Electronic Engineering (863 citations), Geometry and Topology (102 citations) and Artificial Intelligence (398 citations). Darryn Bryant has collaborated with scholars based in Australia, United States and Canada. Frequent co-authors include Peter D. Adams, Daniel Horsley, Abdollah Khodkar, Bronwyn J. Battersby, Matt Trau, C. A. Rodger, Jonathan M. Keith, Peter Danziger, Ian M. Wanless and Mark L. Smythe. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Designs, Journal of Graph Theory, Journal of Combinatorial Theory Series A and Graphs and 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.