Dharam Chopra

Dharam Chopra, Professor

Statistics, Combinatorial Mathematics; PhD, University of Nebraska, 1968

Contact

Awards

University Research Grants: 1998-2004

PhD Students

Mohammad Bsharat, "On the Existence of Balanced Arrays with Two Symbols", PhD thesis, 2002

Research

Professor Chopra's research interests are in the areas of Statistical Design of Experiments, Combinatorial Mathematics, and Graph Theory. A part of his publications include numerous papers on the construction of optimal fractional factorial designs, some of which have been shown to be optimal in the class of all fractional factorial designs. He has published extensively on some combinatorial arrays such as Balanced Arrays and Orthogonal Arrays. He has also made contributions to the area of Graph Theory, in particular dealing with edge-balanced graphs.

Selected Publications

  • Chorpa, D.V., Low, R.M. and Dios, R. On the maximum number of constraints for some balanced arrays. Congressus Numerantium 190 (2008), 5-11
  • Chorpa, D.V. and Bsharat, M. and Mehta, Gobind P. Some new results on balanced arrays of strength five. The Journal of Combinatorial Mathematics and Combinatorial Computing 66 (2008), 59-64.
  • Chopra, D.V. (Invited Paper) Contributions of Statistics to Modern Progress. Choice Vol. 45 (2008), pp. 1097-1107.
  • Chopra, D.V. and Bsharat, M. On The constraints of some combinatorial arrays. The Journal of Combinatorial Mathematics and Combinatorial Computing 62 (2007), 159-164.
  • Chopra, D.V. and Lee, S. M. On the Super edge-magic graphs which are weak magic. The Journal of Combinatorial Mathematics and Combinatorial Computing 62 (2007), 177-187.
  • Chopra, D.V; Low, R.M. and Dios, R. Contributions to orthogonal arrays of strength six. Congressus Numerantium 186 (2007), 193-198.