Peter J. Slater

Publication Activity (10 Years)

Years Active: 1975-2022
Publications (10 Years): 3

Top Topics

Graph Theoretic

Subgraph Isomorphism

Top Venues

Electron. J. Graph Theory Appl.

SIAM J. Discret. Math.

Publications

Suk J. Seo, Peter J. Slater
Graphical parameters for classes of tumbling block graphs. CoRR (2022)
Suk Jai Seo, Peter J. Slater
Open-independent, open-locating-dominating sets. Electron. J. Graph Theory Appl. 5 (2) (2017)
G. Sethuraman, P. Ragukumar, Peter J. Slater
Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph. Discret. Math. 340 (2) (2017)
Suk Jai Seo, Peter J. Slater
Fault tolerant detectors for distinquishing sets in graphs. Discuss. Math. Graph Theory 35 (4) (2015)
Mustapha Chellali, Nader Jafari Rad, Suk Jai Seo, Peter J. Slater
On open neighborhood locating-dominating in graphs. Electron. J. Graph Theory Appl. 2 (2) (2014)
Florent Foucaud, Ralf Klasing, Peter J. Slater
Centroidal bases in graphs. Networks 64 (2) (2014)
J. Louis Sewell, Peter J. Slater
A sharp lower bound for locating-dominating sets in trees. Australas. J Comb. 60 (2014)
Allen O'Neal, Peter J. Slater
Uniqueness of Vertex Magic Constants. SIAM J. Discret. Math. 27 (2) (2013)
J. Louis Sewell, Peter J. Slater
Distance independence in graphs. Discuss. Math. Graph Theory 31 (2) (2011)
Allen O'Neal, Peter J. Slater
An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin, and Spread. Math. Comput. Sci. 5 (1) (2011)
Suk Jai Seo, Peter J. Slater
Open neighborhood locating-dominating in trees. Discret. Appl. Math. 159 (6) (2011)
Suk Jai Seo, Peter J. Slater
Open neighborhood locating-domination for infinite cylinders. ACM Southeast Regional Conference (2011)
Suk Jai Seo, Peter J. Slater
Open neighborhood locating dominating sets. Australas. J Comb. 46 (2010)
Mustapha Chellali, Malika Mimouni, Peter J. Slater
On locating-domination in graphs. Discuss. Math. Graph Theory 30 (2) (2010)
Peter J. Slater
Liar's domination. Networks 54 (2) (2009)
Miranda L. Roden, Peter J. Slater
Liar's domination in graphs. Discret. Math. 309 (19) (2009)
Anne Sinko, Peter J. Slater
Queen's domination using border squares and (A, B)-restricted domination. Discret. Math. 308 (20) (2008)
Robert R. Rubalcaba, Peter J. Slater
domination. Discuss. Math. Graph Theory 27 (3) (2007)
Robert R. Rubalcaba, Peter J. Slater
Roman dominating influence parameters. Discret. Math. 307 (24) (2007)
Suk Jai Seo, Peter J. Slater
An introduction to proper-coupled-domination in graphs. ACM Southeast Regional Conference (2006)
Suk Jai Seo, Peter J. Slater
Competition-reachability of a graph. Discret. Math. 306 (6) (2006)
Teresa W. Haynes, Michael A. Henning, Peter J. Slater
Trees with Equal Domination and Paired-domination Numbers. Ars Comb. 76 (2005)
Suk Jai Seo, Peter J. Slater
An introduction to competition-reachability of a graph. ACM Southeast Regional Conference (1) (2005)
Peter J. Slater, Steven J. Winters
An Introduction to Maximum Sum Permutations of Graphs. Ars Comb. 72 (2004)
Wayne Goddard, Michael Edwin Raines, Peter J. Slater
Distance and connectivity measures in permutation graphs. Discret. Math. 271 (1-3) (2003)
Khee Meng Koh, Bock Boom Lim, Peter J. Slater
-domination in graphs. Discret. Math. 272 (1) (2003)
Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang
-1. Discret. Math. 269 (1-3) (2003)
Teresa W. Haynes, Michael A. Henning, Peter J. Slater
Strong equality of domination parameters in trees. Discret. Math. 260 (1-3) (2003)
Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater
-forming sets in graphs. Discret. Math. 262 (1-3) (2003)
Peter J. Slater
Fault-tolerant locating-dominating sets. Discret. Math. 249 (1-3) (2002)
Peter Dankelmann, Wayne Goddard, Peter J. Slater
Average distance in colored graphs. J. Graph Theory 38 (1) (2001)
Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999)
Christian Smart, Peter J. Slater
Center, median, and centroid subgraphs. Networks 34 (4) (1999)
Peter J. Slater
A survey of sequences of central subgraphs. Networks 34 (4) (1999)
Ashok T. Amin, Lane H. Clark, Peter J. Slater
Parity dimension for graphs. Discret. Math. 187 (1-3) (1998)
Teresa W. Haynes, Peter J. Slater
Paired-domination in graphs. Networks 32 (3) (1998)
Michael A. Henning, Peter J. Slater
Closed neighborhood order dominating functions. Australas. J Comb. 17 (1998)
Michael A. Henning, Peter J. Slater
Inequalities relating domination parameters in cubic graphs. Discret. Math. 158 (1-3) (1996)
David W. Bange, Anthony E. Barkauskas, Linda H. Host, Peter J. Slater
Generalized domination and efficient domination in graphs. Discret. Math. 159 (1-3) (1996)
Johannes H. Hattingh, Michael A. Henning, Peter J. Slater
The algorithmic complexity of signed domination in graphs. Australas. J Comb. 12 (1995)
Johannes H. Hattingh, Michael A. Henning, Peter J. Slater
Three-valued k-neighborhood domination in graphs. Australas. J Comb. 9 (1994)
Dana L. Grinstead, Peter J. Slater
A Recurrence Template for Several Parameters in Series-parallel Graphs. Discret. Appl. Math. 54 (2-3) (1994)
Dana L. Grinstead, Peter J. Slater, Naveed A. Sherwani, Nancy D. Holmes
Efficient Edge Domination Problems in Graphs. Inf. Process. Lett. 48 (5) (1993)
Ashok T. Amin, Kyle Siegrist, Peter J. Slater
On uniformly optimally reliable graphs for pair-connected reliability with vertex failures. Networks 23 (3) (1993)
Kyle Siegrist, Ashok T. Amin, Peter J. Slater
The Optimal Unicyclic Graphs for Pair-Connected Reliability. Discret. Appl. Math. 41 (3) (1993)
Ashok T. Amin, Kyle Siegrist, Peter J. Slater
On the nonexistence of uniformly optimal graphs for pair-connected reliability. Networks 21 (3) (1991)
Richard A. Gibbs, Peter J. Slater
Distinct distance sets in a graph. Discret. Math. 93 (2-3) (1991)
Dana L. Grinstead, Peter J. Slater
On minimum dominating sets with minimum intersection. Discret. Math. 86 (1-3) (1990)
Stephen J. Dow, Douglas F. Rall, Peter J. Slater
Convex labelings of trees. J. Graph Theory 11 (1) (1987)
Peter J. Slater
Domination and location in acyclic graphs. Networks 17 (1) (1987)
Frank Harary, Peter J. Slater
A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23 (6) (1986)
Peter J. Slater
On k-graceful, countably infinite graphs. Discret. Math. 61 (2-3) (1986)
Claudine Peyrat, Douglas F. Rall, Peter J. Slater
On iterated clique graphs with increasing diameters. J. Graph Theory 10 (2) (1986)
David W. Bange, Anthony E. Barkauskas, Peter J. Slater
A note on similar edges and edge-unique line graphs. J. Comb. Theory, Ser. B 38 (1) (1985)
David W. Bange, Anthony E. Barkauskas, Peter J. Slater
Sequentially additive graphs. Discret. Math. 44 (3) (1983)
Peter J. Slater
-graceful, locally finite graphs. J. Comb. Theory, Ser. B 35 (3) (1983)
Peter J. Slater
A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree. Inf. Process. Lett. 15 (4) (1982)
Peter J. Slater
Counterexamples to randić's conjecture on distance degree sequences for trees. J. Graph Theory 6 (1) (1982)
Peter J. Slater
On k-sequential and other numbered graphs. Discret. Math. 34 (2) (1981)
Peter J. Slater
On Locating a Facility to Service Areas within a Network. Oper. Res. 29 (3) (1981)
Fred Buckley, Zevi Miller, Peter J. Slater
On graphs containing a given graph as center. J. Graph Theory 5 (4) (1981)
Peter J. Slater
Accretion centers: A generalization of branch weight centroids. Discret. Appl. Math. 3 (3) (1981)
Peter J. Slater
-nucleus of a graph. Networks 11 (3) (1981)
Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
Information Dissemination in Trees. SIAM J. Comput. 10 (4) (1981)
Christine A. Morgan, Peter J. Slater
A Linear Algorithm for a Core of a Tree. J. Algorithms 1 (3) (1980)
David W. Bange, Anthony E. Barkauskas, Peter J. Slater
Conservative graphs. J. Graph Theory 4 (1) (1980)
Peter J. Slater
Medians of arbitrary graphs. J. Graph Theory 4 (4) (1980)
Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
Matchings and transversals in hypergraphs, domination and independence-in trees. J. Comb. Theory, Ser. B 26 (1) (1979)
Peter J. Slater
Path coverings of the vertices of a tree. Discret. Math. 25 (1) (1979)
Peter J. Slater
Centers to centroids in graphs. J. Graph Theory 2 (3) (1978)
Peter J. Slater
A constructive characterization of trees with at least k disjoint maximum matchings. J. Comb. Theory, Ser. B 25 (3) (1978)
Peter J. Slater
Soldering and point splitting. J. Comb. Theory, Ser. B 24 (3) (1978)
Stephen B. Maurer, Peter J. Slater
On k-minimally n-edge-connected graphs. Discret. Math. 24 (2) (1978)
Stephen B. Maurer, Peter J. Slater
On k-critical, n-connected graphs. Discret. Math. 20 (1977)
Peter J. Slater, Seymour E. Goodman, Stephen T. Hedetniemi
On the optional hamiltonian completion problem. Networks 6 (1) (1976)
Peter J. Slater
R-Domination in Graphs. J. ACM 23 (3) (1976)
Seymour E. Goodman, Stephen T. Hedetniemi, Peter J. Slater
Advances on the Hamiltonian Completion Problem. J. ACM 22 (3) (1975)