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:    siu7684 at siu.edu    or    mcsorley60 at hotmail.com

  1. Designs and other combinatorial structures
    1. Rhombic tilings of (n,k)-ovals, (n,k,λ)-cyclic difference sets, and related topics, with A.Schoen. Discrete Mathematics 313 (2013), pp. 129-154.
      [pdf]
    2. On an Additive Characterization of a Skew Hadamard (n,(n-1)/2,(n-3)/4)-Difference Set in an Abelian Group. Bulletin of the Institute of Combinatorics and its Applications 68 (2013), pp. 27-32.
      [pdf]
    3. Constructing t-designs from t-wise Balanced Designs, with L.H.Soicher. European Journal of Combinatorics 28 (2007), pp. 567-571.
      [pdf]
    4. 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.
      [pdf]
    5. Double Arrays, Triple Arrays, and Balanced Grids with v = r + c - 1. Designs, Codes, and Cryptography 37 (2005), pp. 313--318.
      [pdf]
    6. 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. More Triple Arrays
      [pdf]
    7. Bounds for Overfull Sets of One-Factors, with W.D. Wallis. AWOCA, 15th Australasian Workshop on Combinatorial Algorithms, Ballina, Australia (2004), pp. 40--42.
      [pdf]
    8. 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.
      [pdf]
    9. Single-change Circular Covering Designs. Discrete Mathematics 197 (1999), no 8, pp. 561--588.
      [pdf]
    10. Cyclic Permutations in Doubly-Transitive Groups. Communications in Algebra 25 (1997), pp. 33--35.
      [pdf]
    11. 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.
      [pdf]
  2. Graph theory
    1. Smallest labelled class and largest automorphism group of a tree T_{s,t}. Bulletin of Institute of Combinatorics and its Applications 77 (2016), pp. 71-84.
      [pdf]
    2. On k-minimum and m-minimum Edge Magic Injections of Graphs, with J. Trono. Discrete Mathematics 310 (2010), (no. 1), pp. 56-69.
      [pdf]
    3. Neighborhood Champions in Regular Graphs with W.D. Wallis. Journal of Combinatorial Mathematics and Combinatorial Computing 70 (2009), pp. 49-56.
      [pdf]
    4. Anomaly Graphs and Champions, with C.E. Priebe, W.D. Wallis. Proceedings of International Conference on Mathematics and Computer Science (CMCS). Loyola College, Chennai, India, 2009. (2009), pp. 18-29.
      [pdf]
    5. Enumerating Labelled Graphs with Certain Neighborhood Properties, with L. Clark, S. Holliday, T. Porter. Congressus Numerantium (2008) v. 190, pp. 193-206.
      [pdf]
    6. Constructing and Classifying Neighborhood Anti-Sperner Graphs. Discrete Mathematics 38 (2008), (no.23) 5428--5445.
      [pdf]
    7. Comment on ``The expectation of independent domination number over random binary trees'', with L. Clark. Ars Combinatoria 87 (2008), pp. 257-261.
      [pdf]
    8. 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.
      [pdf]
    9. Closed Neighborhood Anti-Sperner Graphs, with A. Marr, T. Porter, W.D. Wallis. Australasian Journal of Combinatorics 38 (2007), pp. 63-76.
      [pdf]
    10. Totally Magic Injections of Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 56 (2006), pp. 65--81.
      [pdf]
    11. Generating Sequences of Clique-Symmetric Graphs via Eulerian Digraphs, with T. Porter. Discrete Mathematics 287 (2004), pp. 85--91.
      [pdf]
    12. K_p-Removable Sequences of Graphs, with T. Porter. Journal of Combinatorial Mathematics and Combinatorial Computing, 45 (2003), pp. 43--62.
      [pdf]
    13. Clique-Symmetric Uniform Hypergraphs, with T.Porter. Matemàtica Contemporanea 25 (2003), pp. 145--152.
      [pdf]
    14. 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.
      [pdf]
    15. Vertex-Magic Labelings of Trees and Forests, with I.D. Gray, J. MacDougall, W.D. Wallis. Discrete Mathematics, 261 (2003), pp. 285--298.
      [pdf]
    16. Totally Magic Graphs, with G. Exoo, A.C.H. Ling, N.C.K. Phillips, W.D. Wallis. Discrete Mathematics, 254 (2002), pp. 103--113.
      [pdf]
    17. Counting Structures in the Möbius Ladder. Discrete Mathematics, 184 (1998), pp. 137--164.
      [pdf]
    18. 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.
      [pdf]
  3. Combinatorial interpretations of polynomials
    1. Second Quantization of Recurrences, with P. Feinsilver, Graph Polynomials, eds. Y.Shi, M. Dehmer, X.Li, I.Gutman, Chapman Hall/ CRC Press, (2014), pp.61--67.
      [pdf]
    2. The m-Path Cover Polynomial of a Graph and a model for General Coefficient Linear Recurrences, with P. Feinsilver, International Journal of Combinatorics, (2014) v. 2014, Article ID 258017, 13 pages.
      [pdf]
    3. Zeons, Permanents, the Johnson Scheme, and Generalised Derangments, with P. Feinsilver, International Journal of Combinatorics, (2011), Article ID 539030, 29 pages.
      [pdf]
    4. Multivariate Matching Polynomials of Cyclically Labelled Graphs, with P. Feinsilver, Discrete Mathematics 309 (2009), pp.3205--3218.
      [pdf]
    5. Generating Orthogonal Polynomials and their Derivatives using Vertex|Matching Partitions of Graphs, with P. Feinsilver, R. Schott, Ars Combinatoria 87 (2008), pp.75--95.
      [pdf]
    6. A Combinatorial Interpretation of Bessel Polynomials and their First Derivatives as Ordered Hit Polynomials, with P. Feinsilver. Journal of Combin. Mathematics and Combinatorial Computing 39 (2001), pp. 33--48.
      [pdf]
    7. Combinatorial Interpretation and Operator Calculus of Lommel Polynomials, with P. Feinsilver, R. Schott. Journal of Combinatorial Theory 75 (1996), Series A, pp. 163--171.
      [pdf]

Comments: Webmaster

Copyright © 2010, Board of Trustees, Southern Illinois University
Privacy Policy Last Updated