John T. Saccoman

According to our database, John T. Saccoman authored at least 7 papers between 1996 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Dr. Charles L. Suffel: Scholar, teacher, mentor, friend.

Daniel Gross, Nathan Kahl, Kristi Luttrell, John T. Saccoman

Networks, 2022

2013

On Component Order Edge Connectivity Of a Complete Bipartite Graph.

Daniel Gross, L. William Kazmierczak, John T. Saccoman, Charles L. Suffel, Antonius Suhartomo

Ars Comb., 2013

2010

Graphs with the maximum or minimum number of 1-factors.

Daniel Gross, Nathan Kahl, John T. Saccoman

Discret. Math., 2010

2009

A generalization of an edge-connectivity theorem of Chartrand.

Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo

Networks, 2009

2007

A correction in the formula for the number of spanning trees in threshold graphs.

Sarah K. Bleiler, John T. Saccoman

Australas. J Comb., 2007

1998

Uniformly optimally reliable graphs.

Daniel Gross, John T. Saccoman

Networks, 1998

1996

Uniformly least reliable graphs.

Louis Petingi, John T. Saccoman, Laura Schoppmann

Networks, 1996