Daniel Gross , Ph.D.
Professor
Department of Mathematics and Computer Science
(973) 275-5817
Email
McQuaid Hall
Room 200A
Daniel Gross, Ph.D.
My research interests lie in the general field of Graph Theory and specifically in the reliability and connectivity of networks modeled by graphs. I have also done work on spanning trees and factors.
Education
- Ph.D., University of Notre Dame, 1982
- M.S., Stevens Institute of Technology, 1986
- B.S., Seton Hall University, 1977
Scholarship
-
"On Component Order Edge Connectivity of a Complete Bipartite Graph." Ars Combinatoria. May 2011.
-
"Graphs with the Maximum or Minimum Number of 1-Factors." Discrete Mathematics. February 2010.
-
"A Generalization of an Edge-Connectivity Theorem of Chartrand." Journal Networks, 52(2), 82- 89. September 2009.
-
"Realizability Results Involving Two Connectivity Parameters." Ars Combinatoria 82, 181- 191. April 2007.
-
"Bounds For The Component Order Edge Connectivity." Congressus Numerantium 185, 159- 171. March 2007.
-
"Component Order Edge Connectivity - An Introduction." Congressus Numerantium 178, 7- 14, May 2006.