John Saccoman
Professor
Department of Mathematics and Computer Science
Seton Hall University
United States of America
Biography
His selection as a fellow in the Mathematical Association of America's (MAA) Project NExT has been a highlight of his professional career, and he continues 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 his research career, which continues to focus on multigraphs and network reliability theory. He is pleased to say that at least one Saccoman has been on the Seton Hall campus every year since 1957.
Research Interest
Multigraphs and network reliability theory
Publications
-
• "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.
-
• "Laplacian Integral Multigraphs II" w/Joseph O'Connor, Congressus Numerantium, Vol. 223, (2015), pp. 131-143.
-
• "On Neighbor Component Order Edge Connectivity" w/ D. Gross, M. Heinig, C. Suffel,. Congressus Numerantium Vol. 223 (2015), pp. 17-32.
