John P. Georges

672 total citations
21 papers, 508 citations indexed

About

John P. Georges is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, John P. Georges has authored 21 papers receiving a total of 508 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 13 papers in Electrical and Electronic Engineering and 3 papers in Computer Networks and Communications. Recurrent topics in John P. Georges's work include Graph Labeling and Dimension Problems (18 papers), Advanced Graph Theory Research (17 papers) and graph theory and CDMA systems (13 papers). John P. Georges is often cited by papers focused on Graph Labeling and Dimension Problems (18 papers), Advanced Graph Theory Research (17 papers) and graph theory and CDMA systems (13 papers). John P. Georges collaborates with scholars based in United States, South Korea and Ireland. John P. Georges's co-authors include David W. Mauro, Melanie Stein, David Erwin and Yan Wang and has published in prestigious journals such as Public Choice, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

John P. Georges

20 papers receiving 430 citations

Peers

John P. Georges
David W. Mauro United States
David Kuo Taiwan
Daphne Der‐Fen Liu United States
Pranava K. Jha United States
Daniel Gonçalves France
Dalibor Fronček United States
Bert Gerards Netherlands
V. E. Alekseev Russia
Olivier Togni France
Changhong Lü China
David W. Mauro United States
John P. Georges
Citations per year, relative to John P. Georges John P. Georges (= 1×) peers David W. Mauro

Countries citing papers authored by John P. Georges

Since Specialization
Citations

This map shows the geographic impact of John P. Georges'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 John P. Georges with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John P. Georges more than expected).

Fields of papers citing papers by John P. Georges

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John P. Georges. 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 John P. Georges. The network helps show where John P. Georges may publish in the future.

Co-authorship network of co-authors of John P. Georges

This figure shows the co-authorship network connecting the top 25 collaborators of John P. Georges. A scholar is included among the top collaborators of John P. Georges based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with John P. Georges. John P. Georges is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Georges, John P., et al.. (2016). On zero-sum $$\mathbb {Z}_{2j}^k$$ Z 2 j k -magic graphs. Journal of Combinatorial Optimization. 34(1). 94–113. 1 indexed citations
2.
Georges, John P., et al.. (2013). The domination number of K_{n}^3. Discussiones Mathematicae Graph Theory. 34(3). 629–629.
3.
Georges, John P., et al.. (2013). On Zero-Sum Zk-Magic Labelings of 3-Regular Graphs. 2 indexed citations
4.
Georges, John P., et al.. (2012). Relating edge-coverings to the classification of Z2k-magic graphs. Discrete Mathematics. 312(19). 2938–2945. 1 indexed citations
5.
Georges, John P., et al.. (2012). On Zero-Sum $${\mathbb{Z}_k}$$ -Magic Labelings of 3-Regular Graphs. Graphs and Combinatorics. 29(3). 387–398. 2 indexed citations
6.
Georges, John P., David W. Mauro, & Yan Wang. (2009). Labeling the r-path with a condition at distance two. Discrete Applied Mathematics. 157(15). 3203–3215. 1 indexed citations
7.
Georges, John P. & David W. Mauro. (2005). On the Structure of Graphs with Non-Surjective L(2,1)-Labelings. SIAM Journal on Discrete Mathematics. 19(1). 208–223. 7 indexed citations
8.
Georges, John P. & David W. Mauro. (2004). Edge Labelings with a Condition at Distance Two.. Ars Combinatoria. 70. 8 indexed citations
9.
Georges, John P. & David W. Mauro. (2004). A note on collections of graphs with non-surjective lambda labelings. Discrete Applied Mathematics. 146(1). 92–98. 5 indexed citations
10.
Georges, John P. & David W. Mauro. (2003). On Regular Graphs Optimally Labeled with a Condition at Distance Two. SIAM Journal on Discrete Mathematics. 17(2). 320–331. 19 indexed citations
11.
Georges, John P. & David W. Mauro. (2002). Labeling trees with a condition at distance two. Discrete Mathematics. 269(1-3). 127–148. 42 indexed citations
12.
Georges, John P. & David W. Mauro. (2002). On generalized Petersen graphs labeled with a condition at distance two. Discrete Mathematics. 259(1-3). 311–318. 27 indexed citations
13.
Georges, John P., David W. Mauro, & Melanie Stein. (2001). Labeling Products of Complete Graphs with a Condition at Distance Two. SIAM Journal on Discrete Mathematics. 14(1). 28–35. 89 indexed citations
14.
Georges, John P. & David W. Mauro. (1996). On the size of graphs labeled with a condition at distance two. Journal of Graph Theory. 22(1). 47–57. 9 indexed citations
15.
Georges, John P. & David W. Mauro. (1996). On the size of graphs labeled with a condition at distance two. Journal of Graph Theory. 22(1). 47–57. 45 indexed citations
16.
Georges, John P.. (1995). On the harmonious coloring of collections of graphs. Journal of Graph Theory. 20(2). 241–254. 6 indexed citations
17.
Georges, John P., et al.. (1995). On the $\lambda$-Number of $Q_n $ and Related Graphs. SIAM Journal on Discrete Mathematics. 8(4). 499–506. 123 indexed citations
18.
Georges, John P., et al.. (1994). Relating path coverings to vertex labellings with a condition at distance two. Discrete Mathematics. 135(1-3). 103–111. 95 indexed citations
19.
Georges, John P., et al.. (1993). Optimal sophisticated voting strategies in single ballot elections involving three candidates. Public Choice. 77(2). 225–247. 8 indexed citations
20.
Georges, John P.. (1989). Non-hamiltonian bicubic graphs. Journal of Combinatorial Theory Series B. 46(1). 121–124. 8 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by David W. Mauro Breakdown of academic impact, for papers by David Kuo Breakdown of academic impact, for papers by Daphne Der‐Fen Liu Breakdown of academic impact, for papers by Pranava K. Jha Breakdown of academic impact, for papers by Daniel Gonçalves Breakdown of academic impact, for papers by Dalibor Fronček Breakdown of academic impact, for papers by Bert Gerards Breakdown of academic impact, for papers by V. E. Alekseev Breakdown of academic impact, for papers by Olivier Togni Breakdown of academic impact, for papers by Changhong Lü
Rankless by CCL
2026