
John Saccoman, Ph.D.
Professor, Program Adviser for Mathematics and Chair; Department of Mathematics and Computer Science
Department of Mathematics and Computer Science
(973) 761-9466
Email
John Saccoman, Ph.D.
Professor, Program Adviser for Mathematics and Chair; Department of Mathematics and Computer Science
Department of Mathematics and Computer Science
My selection as a fellow in the Mathematical Association of America's (MAA) Project NExT has been a highlight of my professional career, and I continue to be involved in that program, which mentors beginning mathematician at the state level. The Seton Hall University-Stevens Institute of Technology Graph Theory Research Group has been most important in my research career, which continues to focus on multigraphs and network reliability theory.
I am pleased to say that at least one Saccoman has been on the Seton Hall campus every year since 1957.
Education
- Ph.D., Stevens Institute of Technology
- M.S., Stevens Institute of Technology, 1987
- B.S., Seton Hall University
Scholarship
Books
- Understanding Sabermetrics, w/ Rev. G. Costa (SHU/USMA) and Prof. Mike Huber (Muhlenberg), 2008: McFarland
- Solutions manual (w/ JJ Saccoman) for Matrix Methods (3rd ed.) by Bronson and Costa, Elsevier
- Practicing Sabermetrics, w/ Rev. G. Costa (SHU/USMA) and Prof. Mike Huber (Muhlenberg), 2009 : McFarland
- Reasoning with Sabermetrics w/ Rev. G. Costa (SHU/USMA) and Prof. Mike Huber (Muhlenberg), 2012 : McFarland
- Linear Algebra w/ R. Bronson and Rev. G. Costa, 2013: Academic Press
- Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach w/ D. Gross and C. Suffel, 2014; World Scientific Journal
Articles
- "On Neighbor Component Order Edge Connectivity" w/ D. Gross, M. Heinig, C. Suffel,. Congressus Numerantium Vol. 223 (2015), pp. 17-32.
- "Laplacian Integral Multigraphs II" w/Joseph O'Connor, Congressus Numerantium, Vol. 223, (2015), pp. 131-143.
- "Alternate proof of the formula for the characteristic polynomial of a Threshold Graph" w/ D. Gross, M. Heinig, C. Suffel. Congressus Numerantium Vol. 222 (2014), pp. 169-178.
- "On a class of non-Threshold Laplacian Integral Split Graphs" w/ J. Fuller, Congressus Numerantium Vol. 220 (2014), pp. 5-16.
- "Spanning Trees of Almost Ideal Proper Split Graphs" w/ K. Moore. Congressus Numerantium Vol. 216 (2013), pp. 129-141.
- "Optimization results for Reliability Models" w/ C.Suffel, D.Gross, L.Iswara, L.W.Kazmierczak, K.Luttrell, Congressus Numerantium Vol. 216 (2013), pp. 43-54.
- "On Component Order Edge Connectivity of a Complete Bipartite Graph" w/ D. Gross, B. Kazmierczak, C. Suffel, A. Suharotomo, Ars Combinatoria Vol. 112 (2013), pp. 433-448.
- "A Survey of Component Order Connectivity Models of Graph Theoretic Networks" w/ C.Suffel, D.Gross, M.Heinig, L.Iswara, L.W.Kazmierczak, K.Luttrell. WSEAS Transactions on Mathematics Vol. 12 (2013), 895-910.
- "On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles" w/C.Suffel, D.Gross, L.Iswara, L.W.Kazmierczak, K.Luttrell. WSEAS Transactions on Mathematics Vol. 12 (2013), 873-883.
- "The Relationship Between Neighbor-Connectivity, Component Order Connectivity, and Neighbor-Component Order Connectivity" w/ K.Luttrell, L.Iswara, L.W.Kazmierczak, C.Suffel, D.Gross, Congressus Numerantium, 212 (2012), pp. 15-30.
- "On Component Order Edge Reliability and Uniform Optimality" w/ L.Iswara, L.W.Kazmierczak, K.Luttrell, C.Suffel, D.Gross. Congressus Numerantium, 212 (2012), pp. 65-76.
- "Laplacian Integral Multigraphs" w/Monika Heinig, Congressus Numerantium, Vol. 212, (2012), pp. 131-143.
- "On Component Order Edge Reliability and Uniform Optimality" w/ L.Iswara , L.Kazmierczak, K. Luttrell, C.Suffel , D.Gross. Congressus Numerantium 212 (2012), pp. 65-76.
- "The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity" w/ K. Luttrell, L. Iswara, L.W. Kazmierczak, C. Suffel, D. Gross. Congressus Numerantium 212 (2012), pp. 15-30.
- "On weighted component edge connectivity of trees and unicycles" w/ L.Iswara , D.Gross, L.Kazmierczak, A Suhartomo, C.Suffel. Congressus Numerantium 206 (2010), 85-97.
- "Weighted Component Edge Connectivity of Trees and Unicycles II" w/ L. Chandra, D. Gross, L. Kazmierczak, K. Luttrell, C. Suffel. Congressus Numerantium, Vol. 208, (Dec. 2011), pp. 33-54.
- "On Component Order Edge Connectivity of a Complete Bipartite Graph" w/D. Gross, B. Kazmierczak,C. Suffel, A. Suharotomo, accepted by Ars Combinatoria.
- "A surgery reducing the number of spanning trees for threshold graphs by creating a bridge" w/ M. Houck. Congressus Numerantium, Vol. 203, (Dec. 2010), pp. 43-55.
- "On Weighted Component Edge Connectivity of Trees and Cycles" w/ L. Chandra, D. Gross, L. Kazmierczak, A. Suharotomo, C. Suffel. Congressus Numerantium, Vol. 203, (Dec. 2010), pp. 85-97.
- " All I needed to know about teaching mathematics I learned from Bernard Lonergan … and George Harrison" Proceedings of the SHU Center for Catholic Studies Seminar on Teaching as an Ethical Act, (2010), pp. 42-43.
- "Graphs with the maximum number of k-factors" w/ D. Gross and N. Kahl, Discrete Mathematics, Volume 310, Issue 4, Feb., 2010, pp. 687-691.
Accomplishments
Honors and Awards
-
University Research Council Award, 2009, Seton Hall University
-
Who's Who in America's Teachers, 2006
-
Champion of EOF-NJ (2002, 2007)
-
SHU University Teaching Fellow (2x --1997-98, 2001-2002)
Affiliations
-
American Mathematical Society (AMS)
-
Mathematical Association of America (MAA)
-
Society of American Baseball Research (SABR); also, Elysian Fields Chapter (SABR-NJ)