Combinatorial Interpretation and Operator Calculus of Lommel Polynomials. - Philip Feinsilver; John P. McSorley; René Schott (J. Comb. Theory A, 1996)

Counting structures in the Möbius ladder. - John P. McSorley (Discret. Math., 1998)

Single-change circular covering designs. - John P. McSorley (Discret. Math., 1999)

Totally magic graphs. - Geoffrey Exoo; Alan C. H. Ling; John P. McSorley; Nicholas C. K. Phillips; Walter D. Wallis (Discret. Math., 2002)

Vertex-magic labeling of trees and forests. - Ian D. Gray; Jim A. MacDougall; John P. McSorley; Walter D. Wallis (Discret. Math., 2003)

Generating sequences of clique-symmetric graphs via Eulerian digraphs. - John P. McSorley; Thomas Dale Porter (Discret. Math., 2004)

Double Arrays, Triple Arrays and Balanced Grids with v=r+c - 1. - John P. McSorley (Des. Codes Cryptogr., 2005)

Double Arrays, Triple Arrays and Balanced Grids. - John P. McSorley; Nicholas C. K. Phillips; Walter D. Wallis; Joseph L. Yucas (Des. Codes Cryptogr., 2005)

Closed-neighbourhood anti-Sperner graphs. - John P. McSorley; Alison Marr; Thomas Dale Porter; Walter D. Wallis (Australas. J Comb., 2007)

Constructing t-designs from t-wise balanced designs. - John P. McSorley; Leonard H. Soicher (Eur. J. Comb., 2007)

Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs. - John P. McSorley; Philip Feinsilver; René Schott (Ars Comb., 2008)

Constructing and classifying neighborhood anti-Sperner graphs. - John P. McSorley (Discret. Math., 2008)

Multivariate matching polynomials of cyclically labelled graphs. - John P. McSorley; Philip Feinsilver (Discret. Math., 2009)

On k-minimum and m-minimum edge-magic injections of graphs. - John P. McSorley; John A. Trono (Discret. Math., 2010)

Rhombic tilings of (n, k)-Ovals, (n, k, λ)-cyclic difference sets, and related topics. - John P. McSorley; Alan H. Schoen (Discret. Math., 2013)