Peter J. Slater

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