Dr. Peter Slater

Professor, Computer Science Department Professor, Mathematical Sciences Department

Biography

Following a year as an NRC Postdoctoral Fellow at the National Bureau of Standards and six years in the Applied Math Division at Sandia Laboratories, Dr. Slater joined UAH in 1981. He is the author/co-author of over 200 refereed publications.

Education

  • Ph.D., Mathematics, University of Iowa, 1973
  • M.S., Computer Science, The University of Alabama in Huntsville, 1987
  • M.S., Mathematics, University of Iowa, 1972
  • B.A., Mathematics, Iona College, 1968

Publications

  • S. J. Seo and P. J. Slater, Fault tolerant detectors for distinguishing sets in graphs, Discussiones Mathematicae Graph Theory 35 (2015), 797-818.
  • P. M. Marples and P. J. Slater, Graph sharing, Congressus Numerantium 224 (2015), 175-184.
  • Foucaud, Florent, Ralf Klasing, and Peter J. Slater. "Centroidal bases in graphs." Networks 64.2 (2014): 96-108.
  • Sethuraman, G., P. Ragukumar, and Peter J. Slater. "Embedding an Arbitrary Tree in a Graceful Tree." Bulletin of the Malaysian Mathematical Sciences Society (2015): 1-20.
  • Barbosa, Rommel, and Peter Slater. "On the efficiency index of a graph." Journal of Combinatorial Optimization (2014): 1-8.
  • OLD trees with maximum degree three, Utilitas Mathematica 94,2014, 361-380 (with Suk Seo).
  • On the efficiency index of a graph, J. Combinatorial Optimization 11, 10.;1007/s10878-014-9814-1 (with R. Barbosa).
  • Centroidal bases in graphs, Networks 64, 2014, 96-108 arxiv.org/abs/1406.7490 (with F. Foucaud and R. Klasing).
  • On open neighborhood locating-dominating in graphs, Elec. J. Graph Theory and Applications 2, 2014, 87-98 (with M. Chellali, N. J. Rad and S. Seo