Advances on the Hamiltonian Completion Problem. - Seymour E. Goodman; Stephen T. Hedetniemi; Peter J. Slater (J. ACM, 1975)

R-Domination in Graphs. - Peter J. Slater (J. ACM, 1976)

On the optional hamiltonian completion problem. - Peter J. Slater; Seymour E. Goodman; Stephen T. Hedetniemi (Networks, 1976)

On k-critical, n-connected graphs. - Stephen B. Maurer; Peter J. Slater (Discret. Math., 1977)

On k-minimally n-edge-connected graphs. - Stephen B. Maurer; Peter J. Slater (Discret. Math., 1978)

A constructive characterization of trees with at least k disjoint maximum matchings. - Peter J. Slater (J. Comb. Theory B, 1978)

Soldering and point splitting. - Peter J. Slater (J. Comb. Theory B, 1978)

Centers to centroids in graphs. - Peter J. Slater (J. Graph Theory, 1978)

Path coverings of the vertices of a tree. - Peter J. Slater (Discret. Math., 1979)

Matchings and transversals in hypergraphs, domination and independence-in trees. - Ernest J. Cockayne; Stephen T. Hedetniemi; Peter J. Slater (J. Comb. Theory B, 1979)

A Linear Algorithm for a Core of a Tree. - Christine A. Morgan; Peter J. Slater (J. Algorithms, 1980)

Conservative graphs. - David W. Bange; Anthony E. Barkauskas; Peter J. Slater (J. Graph Theory, 1980)

Medians of arbitrary graphs. - Peter J. Slater (J. Graph Theory, 1980)

Accretion centers: A generalization of branch weight centroids. - Peter J. Slater (Discret. Appl. Math., 1981)

On k-sequential and other numbered graphs. - Peter J. Slater (Discret. Math., 1981)

On Locating a Facility to Service Areas within a Network. - Peter J. Slater (Oper. Res., 1981)

On graphs containing a given graph as center. - Fred Buckley; Zevi Miller; Peter J. Slater (J. Graph Theory, 1981)

The k-nucleus of a graph. - Peter J. Slater (Networks, 1981)

Information Dissemination in Trees. - Peter J. Slater; Ernest J. Cockayne; Stephen T. Hedetniemi (SIAM J. Comput., 1981)

A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree. - Peter J. Slater (Inf. Process. Lett., 1982)

Counterexamples to randić's conjecture on distance degree sequences for trees. - Peter J. Slater (J. Graph Theory, 1982)

Sequentially additive graphs. - David W. Bange; Anthony E. Barkauskas; Peter J. Slater (Discret. Math., 1983)

On k-graceful, locally finite graphs. - Peter J. Slater (J. Comb. Theory B, 1983)

A note on similar edges and edge-unique line graphs. - David W. Bange; Anthony E. Barkauskas; Peter J. Slater (J. Comb. Theory B, 1985)

Packing a tree with a graph of the same size. - Peter J. Slater; S. K. Teo; H. P. Yap (J. Graph Theory, 1985)

On k-graceful, countably infinite graphs. - Peter J. Slater (Discret. Math., 1986)

A Linear Algorithm for the Cutting Center of a Tree. - Frank Harary; Peter J. Slater (Inf. Process. Lett., 1986)

On iterated clique graphs with increasing diameters. - Claudine Peyrat; Douglas F. Rall; Peter J. Slater (J. Graph Theory, 1986)

Convex labelings of trees. - Stephen J. Dow; Douglas F. Rall; Peter J. Slater (J. Graph Theory, 1987)

Domination and location in acyclic graphs. - Peter J. Slater (Networks, 1987)

On minimum dominating sets with minimum intersection. - Dana L. Grinstead; Peter J. Slater (Discret. Math., 1990)

Distinct distance sets in a graph. - Richard A. Gibbs; Peter J. Slater (Discret. Math., 1991)

On the nonexistence of uniformly optimal graphs for pair-connected reliability. - Ashok T. Amin; Kyle Siegrist; Peter J. Slater (Networks, 1991)

The Optimal Unicyclic Graphs for Pair-Connected Reliability. - Kyle Siegrist; Ashok T. Amin; Peter J. Slater (Discret. Appl. Math., 1993)

Efficient Edge Domination Problems in Graphs. - Dana L. Grinstead; Peter J. Slater; Naveed A. Sherwani; Nancy D. Holmes (Inf. Process. Lett., 1993)

On uniformly optimally reliable graphs for pair-connected reliability with vertex failures. - Ashok T. Amin; Kyle Siegrist; Peter J. Slater (Networks, 1993)

Three-valued k-neighborhood domination in graphs. - Johannes H. Hattingh; Michael A. Henning; Peter J. Slater (Australas. J Comb., 1994)

A Recurrence Template for Several Parameters in Series-parallel Graphs. - Dana L. Grinstead; Peter J. Slater (Discret. Appl. Math., 1994)

The algorithmic complexity of signed domination in graphs. - Johannes H. Hattingh; Michael A. Henning; Peter J. Slater (Australas. J Comb., 1995)

Generalized domination and efficient domination in graphs. - David W. Bange; Anthony E. Barkauskas; Linda H. Host; Peter J. Slater (Discret. Math., 1996)

Inequalities relating domination parameters in cubic graphs. - Michael A. Henning; Peter J. Slater (Discret. Math., 1996)

Fundamentals of domination in graphs. - Teresa W. Haynes; Stephen T. Hedetniemi; Peter J. Slater (Dekker, 1998)

Closed neighborhood order dominating functions. - Michael A. Henning; Peter J. Slater (Australas. J Comb., 1998)

Parity dimension for graphs. - Ashok T. Amin; Lane H. Clark; Peter J. Slater (Discret. Math., 1998)

Paired-domination in graphs. - Teresa W. Haynes; Peter J. Slater (Networks, 1998)

Bounds on the Total Redundance and Efficiency of a Graph. - Wayne Goddard; Ortrud Oellermann; Peter J. Slater; Henda C. Swart (Ars Comb., 1999)

A survey of sequences of central subgraphs. - Peter J. Slater (Networks, 1999)

Center, median, and centroid subgraphs. - Christian Smart; Peter J. Slater (Networks, 1999)

Average distance in colored graphs. - Peter Dankelmann; Wayne Goddard; Peter J. Slater (J. Graph Theory, 2001)

Fault-tolerant locating-dominating sets. - Peter J. Slater (Discret. Math., 2002)

Graphs of order n with locating-chromatic number n-1. - Gary Chartrand; David Erwin; Michael A. Henning; Peter J. Slater; Ping Zhang 004 (Discret. Math., 2003)

Distance and connectivity measures in permutation graphs. - Wayne Goddard; Michael Edwin Raines; Peter J. Slater (Discret. Math., 2003)

H-forming sets in graphs. - Teresa W. Haynes; Stephen T. Hedetniemi; Michael A. Henning; Peter J. Slater (Discret. Math., 2003)

Strong equality of domination parameters in trees. - Teresa W. Haynes; Michael A. Henning; Peter J. Slater (Discret. Math., 2003)

H-domination in graphs. - Khee Meng Koh; Bock Boom Lim; Peter J. Slater (Discret. Math., 2003)

An Introduction to Maximum Sum Permutations of Graphs. - Peter J. Slater; Steven J. Winters (Ars Comb., 2004)

An introduction to competition-reachability of a graph. - Suk Jai Seo; Peter J. Slater (ACM Southeast Regional Conference (1), 2005)

Trees with Equal Domination and Paired-domination Numbers. - Teresa W. Haynes; Michael A. Henning; Peter J. Slater (Ars Comb., 2005)

An introduction to proper-coupled-domination in graphs. - Suk Jai Seo; Peter J. Slater (ACM Southeast Regional Conference, 2006)

Competition-reachability of a graph. - Suk Jai Seo; Peter J. Slater (Discret. Math., 2006)

Roman dominating influence parameters. - Robert R. Rubalcaba; Peter J. Slater (Discret. Math., 2007)

Efficient (j, k)-domination. - Robert R. Rubalcaba; Peter J. Slater (Discuss. Math. Graph Theory, 2007)

Queen's domination using border squares and (A, B)-restricted domination. - Anne Sinko; Peter J. Slater (Discret. Math., 2008)

Liar's domination in graphs. - Miranda L. Roden; Peter J. Slater (Discret. Math., 2009)

Liar's domination. - Peter J. Slater (Networks, 2009)

Open neighborhood locating dominating sets. - Suk Jai Seo; Peter J. Slater (Australas. J Comb., 2010)

On locating-domination in graphs. - Mustapha Chellali; Malika Mimouni; Peter J. Slater (Discuss. Math. Graph Theory, 2010)

Open neighborhood locating-domination for infinite cylinders. - Suk Jai Seo; Peter J. Slater (ACM Southeast Regional Conference, 2011)

Open neighborhood locating-dominating in trees. - Suk Jai Seo; Peter J. Slater (Discret. Appl. Math., 2011)

Distance independence in graphs. - J. Louis Sewell; Peter J. Slater (Discuss. Math. Graph Theory, 2011)

An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin, and Spread. - Allen O'Neal; Peter J. Slater (Math. Comput. Sci., 2011)

Uniqueness of Vertex Magic Constants. - Allen O'Neal; Peter J. Slater (SIAM J. Discret. Math., 2013)

A sharp lower bound for locating-dominating sets in trees. - J. Louis Sewell; Peter J. Slater (Australas. J Comb., 2014)

On open neighborhood locating-dominating in graphs. - Mustapha Chellali; Nader Jafari Rad; Suk Jai Seo; Peter J. Slater (Electron. J. Graph Theory Appl., 2014)

Centroidal bases in graphs. - Florent Foucaud; Ralf Klasing; Peter J. Slater (Networks, 2014)

Fault tolerant detectors for distinquishing sets in graphs. - Suk Jai Seo; Peter J. Slater (Discuss. Math. Graph Theory, 2015)

Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph. - G. Sethuraman 001; P. Ragukumar; Peter J. Slater (Discret. Math., 2017)

Open-independent, open-locating-dominating sets. - Suk Jai Seo; Peter J. Slater (Electron. J. Graph Theory Appl., 2017)

Graphical parameters for classes of tumbling block graphs. - Suk Jai Seo; Peter J. Slater (CoRR, 2022)