C. A. Rodger
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Finite Group Theory Research 43
- Limits and Structures in Graph Theory 14
-
- Advanced Graph Theory Research 37
- Graph Labeling and Dimension Problems 21
- Co-authors
- C.C. LindnerD. G. HoffmanHung‐Lin FuA. J. W. HiltonDarryn BryantKevin T. PhelpsMirka MillerRinovia Simanjuntak
- Journals
- Discrete Mathematics (37 papers)Journal of Graph Theory (15 papers)Journal of Combinatorial Designs (12 papers)Journal of Combinatorial Theory Series A (9 papers)Graphs and Combinatorics (8 papers)
- Partner nations
- United StatesAustraliaTaiwan
In The Last Decade
C. A. Rodger
114 papers receiving 917 citations
Peers
Comparison fields: 5 of 54
- Discrete Mathematics and Combinatorics 432
- Computational Theory and Mathematics 478
- Electrical and Electronic Engineering 763
- Geometry and Topology 103
- Artificial Intelligence 360
Countries citing papers authored by C. A. Rodger
This map shows the geographic impact of C. A. Rodger'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 C. A. Rodger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C. A. Rodger more than expected).
Fields of papers citing papers by C. A. Rodger
This network shows the impact of papers produced by C. A. Rodger. 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 C. A. Rodger. The network helps show where C. A. Rodger may publish in the future.
Co-authors
The 25 scholars most cited alongside C. A. Rodger, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | Extreme equitable block colorings of C 4 -decompositions of K v -F. | 2018 | 0 |
| 3 | 2015 | 1 | |
| 4 | 2008 | 1 | |
| 5 | 2007 | 1 | |
| 6 | Hamilton decompositions of complete bipartite graphs with a 3-factor leave | 2005 | 3 |
| 7 | Distance magic labelings of graphs. | 2003 | 61 |
| 8 | A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs | 2003 | 1 |
| 9 | 2003 | 5 | |
| 10 | 2002 | 22 | |
| 11 | Coding Theory and Cryptography: The Essentials | 2000 | 23 |
| 12 | 1998 | 23 | |
| 13 | 1997 | 27 | |
| 14 | 1996 | 5 | |
| 15 | Recent results on the embedding of latin squares and related structures, cycle systems and graph design | 1992 | 11 |
| 16 | 1992 | 20 | |
| 17 | 2-colouring K 4 -e designs. | 1991 | 6 |
| 18 | The intersection problem for minimum coverings of K n by triples. | 1991 | 2 |
| 19 | Class one graphs | 1987 | 1 |
| 20 | 1987 | 5 |
About C. A. Rodger
C. A. Rodger is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology and Computer Graphics and Computer-Aided Design, having authored 125 papers that have together received 1.0k indexed citations. Recurring topics across this work include graph theory and CDMA systems (101 papers), Finite Group Theory Research (43 papers), Coding theory and cryptography (40 papers), Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (21 papers), Interconnection Networks and Systems (16 papers), Limits and Structures in Graph Theory (14 papers) and Mathematics and Applications (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (432 citations), Computational Theory and Mathematics (478 citations), Electrical and Electronic Engineering (763 citations), Geometry and Topology (103 citations) and Artificial Intelligence (360 citations). C. A. Rodger has collaborated with scholars based in United States, Australia and Taiwan. Frequent co-authors include C.C. Lindner, D. G. Hoffman, Hung‐Lin Fu, A. J. W. Hilton, Darryn Bryant, Kevin T. Phelps, Mirka Miller, Rinovia Simanjuntak, Chris Leach and Charles C. Lindner. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Journal of Combinatorial Designs, 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.