John P. McSorley

PUBLICATIONS

Research Papers: Published or accepted. Arranged into three groups:

1. Designs and other combinatorial structures,
2. Graph theory,
3. Combinatorial interpretations of polynomials.

Please contact me if reprints or preprints are required:    jmcsorley at math.siu.edu    or    mcsorley60 at hotmail.com

---

1. Designs and other combinatorial structures
1. Constructing t-designs from t-wise Balanced Designs, with L.H.Soicher. European Journal of Combinatorics 28 (2007), pp. 567-571.
   [abstract] [dvi] [pdf]
2. Complete Enumeration and Properties of Binary Pseudo-Youden Designs PYD(9,6,6), with N.C.K.Phillips. Journal of Statistical Planning and Inference 137 (2007), pp. 1464-1473.
   [abstract] [dvi] [pdf]
3. Double Arrays, Triple Arrays, and Balanced Grids with v = r + c - 1. Designs, Codes, and Cryptography 37 (2005), pp. 313--318.
   [abstract] [dvi] [pdf]
4. Double Arrays, Triple Arrays, and Balanced Grids, with N.C.K. Phillips, J. Yucas, W.D. Wallis. Designs, Codes, and Cryptography 35 (2005), pp. 21--45.
   [abstract] [dvi] [pdf]
5. Bounds for Overfull Sets of One-Factors, with W.D. Wallis. AWOCA, 15th Australasian Workshop on Combinatorial Algorithms, Ballina, Australia (2004), pp. 40--42.
   [abstract] [dvi] [pdf]
6. Orthogonal Arrays of Strength Three from Regular 3-wise Balanced Designs,
   with C. Colbourn, D. Kreher, D. Stinson. Journal of Statistical Planning and Inference 100 (2002), pp. 191--195.
   [abstract] [dvi] [pdf]
7. Single-change Circular Covering Designs. Discrete Mathematics 197 (1999), no 8, pp. 561--588.
   [abstract] [dvi] [pdf]
8. Cyclic Permutations in Doubly-Transitive Groups. Communications in Algebra 25 (1997), pp. 33--35.
   [abstract] [dvi] [pdf]
9. Tight Single-Change Covering Designs, with D.A. Preece, R.L. Constable, N.C.K. Phillips, W.D. Wallis, J.L. Yucas, G. Zhang. Utilitas Mathematica 47 (1995), pp. 55--84.
   [abstract] [dvi] [pdf] [txt]
2. Graph theory
   10. Constructing and Classifying Neighborhood Anti-Sperner Graphs. To appear in Discrete Mathematics.
       [abstract] [dvi] [pdf]
   11. Comment on ``The expectation of independent domination number over random binary trees'', with L. Clark. To appear in the Ars Combinatoria.
       [abstract] [dvi] [pdf]
   12. There are No Non-trivally Uniformly (t,r)-regular Graphs for t >2, with D. Hoffman, P. Johnson, K. Lin, C. Petrie, L. Teirlinck. Bulletin of the Institute of Combinatorics and its Applications 49 (2007), pp. 11-14.
       [abstract] [dvi] [pdf]
   13. Closed Neighborhood Anti-Sperner Graphs, with A. Marr, T. Porter, W.D. Wallis. Australasian Journal of Combinatorics 38 (2007), pp. 63-76.
       [abstract] [dvi] [pdf]
   14. Totally Magic Injections of Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 56 (2006), pp. 65--81.
       [abstract] [dvi] [pdf]
   15. Generating Sequences of Clique-Symmetric Graphs via Eulerian Digraphs, with T. Porter. Discrete Mathematics 287 (2004), pp. 85--91.
       [abstract] [dvi] [pdf]
   16. K_p-Removable Sequences of Graphs, with T. Porter. Journal of Combinatorial Mathematics and Combinatorial Computing, 45 (2003), pp. 43--62.
       [abstract] [dvi] [pdf]
   17. Clique-Symmetric Uniform Hypergraphs, with T.Porter. Matemàtica Contemporanea 25 (2003), pp. 145--152.
       [abstract] [dvi] [pdf]
   18. On the Spectra of Totally Magic Labelings, with W.D. Wallis. Bulletin of the Institute of Combinatorics and its Applications, 37 (2003), pp. 58--62.
       [abstract] [dvi] [pdf]
   19. Vertex-Magic Labelings of Trees and Forests, with I.D. Gray, J. MacDougall, W.D. Wallis. Discrete Mathematics, 261 (2003), pp. 285--298.
       [abstract] [dvi] [pdf]
   20. Totally Magic Graphs, with G. Exoo, A.C.H. Ling, N.C.K. Phillips, W.D. Wallis. Discrete Mathematics, 254 (2002), pp. 103--113.
       [abstract] [dvi] [pdf]
   21. Counting Structures in the Möbius Ladder. Discrete Mathematics, 184 (1998), pp. 137--164.
       [abstract] [dvi] [pdf]
   22. A Generalized Coloring of Graphs, with A. Amin, L. Clark, H. Wang, G. Zhang. Journal of Combinatorial Mathematics and Combinatorial Computing 24 (1997), pp. 49--63.
       [abstract] [dvi] [pdf]
3. Combinatorial interpretations of polynomials
23. Generating Orthogonal Polynomials and their Derivatives using Vertex|Matching Partitions of Graphs, with P. Feinsilver, R. Schott. To appear in Ars Combinatoria.
    [abstract] [dvi] [pdf]
24. A Combinatorial Interpretation of Bessel Polynomials and their First Derivatives as Ordered Hit Polynomials, with P. Feinsilver. Journal of Combinatorial Mathematics and Combinatorial Computing 39 (2001), pp. 33--48.
    [abstract] [dvi] [pdf]
25. Combinatorial Interpretation and Operator Calculus of Lommel Polynomials, with P. Feinsilver, R. Schott. Journal of Combinatorial Theory 75 (1996), Series A, pp. 163--171.
    [abstract] [dvi] [pdf]