default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter J. Slater
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i1]Suk Jai Seo, Peter J. Slater:
Graphical parameters for classes of tumbling block graphs. CoRR abs/2202.02620 (2022)
2010 – 2019
- 2017
- [j74]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): 96-106 (2017) - [j73]Suk Jai Seo, Peter J. Slater:
Open-independent, open-locating-dominating sets. Electron. J. Graph Theory Appl. 5(2): 179-193 (2017) - 2015
- [j72]Suk Jai Seo, Peter J. Slater:
Fault tolerant detectors for distinquishing sets in graphs. Discuss. Math. Graph Theory 35(4): 797-818 (2015) - 2014
- [j71]J. Louis Sewell, Peter J. Slater:
A sharp lower bound for locating-dominating sets in trees. Australas. J Comb. 60: 136-149 (2014) - [j70]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): 87-98 (2014) - [j69]Florent Foucaud, Ralf Klasing, Peter J. Slater:
Centroidal bases in graphs. Networks 64(2): 96-108 (2014) - 2013
- [j68]Allen O'Neal, Peter J. Slater:
Uniqueness of Vertex Magic Constants. SIAM J. Discret. Math. 27(2): 708-716 (2013) - 2011
- [j67]Suk Jai Seo, Peter J. Slater:
Open neighborhood locating-dominating in trees. Discret. Appl. Math. 159(6): 484-489 (2011) - [j66]J. Louis Sewell, Peter J. Slater:
Distance independence in graphs. Discuss. Math. Graph Theory 31(2): 397-409 (2011) - [j65]Allen O'Neal, Peter J. Slater:
An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin, and Spread. Math. Comput. Sci. 5(1): 69-80 (2011) - [c3]Suk Jai Seo, Peter J. Slater:
Open neighborhood locating-domination for infinite cylinders. ACM Southeast Regional Conference 2011: 334-335 - 2010
- [j64]Suk Jai Seo, Peter J. Slater:
Open neighborhood locating dominating sets. Australas. J Comb. 46: 109-120 (2010) - [j63]Mustapha Chellali, Malika Mimouni, Peter J. Slater:
On locating-domination in graphs. Discuss. Math. Graph Theory 30(2): 223-235 (2010)
2000 – 2009
- 2009
- [j62]Miranda L. Roden, Peter J. Slater:
Liar's domination in graphs. Discret. Math. 309(19): 5884-5890 (2009) - [j61]Peter J. Slater:
Liar's domination. Networks 54(2): 70-74 (2009) - 2008
- [j60]Anne Sinko, Peter J. Slater:
Queen's domination using border squares and (A, B)-restricted domination. Discret. Math. 308(20): 4822-4828 (2008) - 2007
- [j59]Robert R. Rubalcaba, Peter J. Slater:
Roman dominating influence parameters. Discret. Math. 307(24): 3194-3200 (2007) - [j58]Robert R. Rubalcaba, Peter J. Slater:
Efficient (j, k)-domination. Discuss. Math. Graph Theory 27(3): 409-423 (2007) - 2006
- [j57]Suk Jai Seo, Peter J. Slater:
Competition-reachability of a graph. Discret. Math. 306(6): 580-590 (2006) - [c2]Suk Jai Seo, Peter J. Slater:
An introduction to proper-coupled-domination in graphs. ACM Southeast Regional Conference 2006: 265-270 - 2005
- [j56]Teresa W. Haynes, Michael A. Henning, Peter J. Slater:
Trees with Equal Domination and Paired-domination Numbers. Ars Comb. 76 (2005) - [c1]Suk Jai Seo, Peter J. Slater:
An introduction to competition-reachability of a graph. ACM Southeast Regional Conference (1) 2005: 121-125 - 2004
- [j55]Peter J. Slater, Steven J. Winters:
An Introduction to Maximum Sum Permutations of Graphs. Ars Comb. 72 (2004) - 2003
- [j54]Teresa W. Haynes, Michael A. Henning, Peter J. Slater:
Strong equality of domination parameters in trees. Discret. Math. 260(1-3): 77-87 (2003) - [j53]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater:
H-forming sets in graphs. Discret. Math. 262(1-3): 159-169 (2003) - [j52]Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang:
Graphs of order n with locating-chromatic number n-1. Discret. Math. 269(1-3): 65-79 (2003) - [j51]Wayne Goddard, Michael Edwin Raines, Peter J. Slater:
Distance and connectivity measures in permutation graphs. Discret. Math. 271(1-3): 61-70 (2003) - [j50]Khee Meng Koh, Bock Boom Lim, Peter J. Slater:
H-domination in graphs. Discret. Math. 272(1): 97-105 (2003) - 2002
- [j49]Peter J. Slater:
Fault-tolerant locating-dominating sets. Discret. Math. 249(1-3): 179-189 (2002) - 2001
- [j48]Peter Dankelmann, Wayne Goddard, Peter J. Slater:
Average distance in colored graphs. J. Graph Theory 38(1): 1-17 (2001)
1990 – 1999
- 1999
- [j47]Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart:
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999) - [j46]Peter J. Slater:
A survey of sequences of central subgraphs. Networks 34(4): 244-249 (1999) - [j45]Christian Smart, Peter J. Slater:
Center, median, and centroid subgraphs. Networks 34(4): 303-311 (1999) - 1998
- [b1]Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater:
Fundamentals of domination in graphs. Pure and applied mathematics 208, Dekker 1998, ISBN 978-0-8247-0033-1, pp. I-XI, 1-446 - [j44]Michael A. Henning, Peter J. Slater:
Closed neighborhood order dominating functions. Australas. J Comb. 17: 77-88 (1998) - [j43]Ashok T. Amin, Lane H. Clark, Peter J. Slater:
Parity dimension for graphs. Discret. Math. 187(1-3): 1-17 (1998) - [j42]Teresa W. Haynes, Peter J. Slater:
Paired-domination in graphs. Networks 32(3): 199-206 (1998) - 1996
- [j41]Michael A. Henning, Peter J. Slater:
Inequalities relating domination parameters in cubic graphs. Discret. Math. 158(1-3): 87-98 (1996) - [j40]David W. Bange, Anthony E. Barkauskas, Linda H. Host, Peter J. Slater:
Generalized domination and efficient domination in graphs. Discret. Math. 159(1-3): 1-11 (1996) - 1995
- [j39]Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
The algorithmic complexity of signed domination in graphs. Australas. J Comb. 12: 101-112 (1995) - 1994
- [j38]Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
Three-valued k-neighborhood domination in graphs. Australas. J Comb. 9: 233-242 (1994) - [j37]Dana L. Grinstead, Peter J. Slater:
A Recurrence Template for Several Parameters in Series-parallel Graphs. Discret. Appl. Math. 54(2-3): 151-168 (1994) - 1993
- [j36]Kyle Siegrist, Ashok T. Amin, Peter J. Slater:
The Optimal Unicyclic Graphs for Pair-Connected Reliability. Discret. Appl. Math. 41(3): 235-243 (1993) - [j35]Dana L. Grinstead, Peter J. Slater, Naveed A. Sherwani, Nancy D. Holmes:
Efficient Edge Domination Problems in Graphs. Inf. Process. Lett. 48(5): 221-228 (1993) - [j34]Ashok T. Amin, Kyle Siegrist, Peter J. Slater:
On uniformly optimally reliable graphs for pair-connected reliability with vertex failures. Networks 23(3): 185-193 (1993) - 1991
- [j33]Richard A. Gibbs, Peter J. Slater:
Distinct distance sets in a graph. Discret. Math. 93(2-3): 155-165 (1991) - [j32]Ashok T. Amin, Kyle Siegrist, Peter J. Slater:
On the nonexistence of uniformly optimal graphs for pair-connected reliability. Networks 21(3): 359-368 (1991) - 1990
- [j31]Dana L. Grinstead, Peter J. Slater:
On minimum dominating sets with minimum intersection. Discret. Math. 86(1-3): 239-254 (1990)
1980 – 1989
- 1987
- [j30]Stephen J. Dow, Douglas F. Rall, Peter J. Slater:
Convex labelings of trees. J. Graph Theory 11(1): 59-70 (1987) - [j29]Peter J. Slater:
Domination and location in acyclic graphs. Networks 17(1): 55-64 (1987) - 1986
- [j28]Peter J. Slater:
On k-graceful, countably infinite graphs. Discret. Math. 61(2-3): 293-303 (1986) - [j27]Frank Harary, Peter J. Slater:
A Linear Algorithm for the Cutting Center of a Tree. Inf. Process. Lett. 23(6): 317-319 (1986) - [j26]Claudine Peyrat, Douglas F. Rall, Peter J. Slater:
On iterated clique graphs with increasing diameters. J. Graph Theory 10(2): 167-171 (1986) - 1985
- [j25]David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
A note on similar edges and edge-unique line graphs. J. Comb. Theory B 38(1): 31-40 (1985) - [j24]Peter J. Slater, S. K. Teo, H. P. Yap:
Packing a tree with a graph of the same size. J. Graph Theory 9(2): 213-216 (1985) - 1983
- [j23]David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
Sequentially additive graphs. Discret. Math. 44(3): 235-241 (1983) - [j22]Peter J. Slater:
On k-graceful, locally finite graphs. J. Comb. Theory B 35(3): 319-322 (1983) - 1982
- [j21]Peter J. Slater:
A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree. Inf. Process. Lett. 15(4): 186-188 (1982) - [j20]Peter J. Slater:
Counterexamples to randić's conjecture on distance degree sequences for trees. J. Graph Theory 6(1): 89-92 (1982) - 1981
- [j19]Peter J. Slater:
Accretion centers: A generalization of branch weight centroids. Discret. Appl. Math. 3(3): 187-192 (1981) - [j18]Peter J. Slater:
On k-sequential and other numbered graphs. Discret. Math. 34(2): 185-193 (1981) - [j17]Peter J. Slater:
On Locating a Facility to Service Areas within a Network. Oper. Res. 29(3): 523-531 (1981) - [j16]Fred Buckley, Zevi Miller, Peter J. Slater:
On graphs containing a given graph as center. J. Graph Theory 5(4): 427-434 (1981) - [j15]Peter J. Slater:
The k-nucleus of a graph. Networks 11(3): 233-242 (1981) - [j14]Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi:
Information Dissemination in Trees. SIAM J. Comput. 10(4): 692-701 (1981) - 1980
- [j13]Christine A. Morgan, Peter J. Slater:
A Linear Algorithm for a Core of a Tree. J. Algorithms 1(3): 247-258 (1980) - [j12]David W. Bange, Anthony E. Barkauskas, Peter J. Slater:
Conservative graphs. J. Graph Theory 4(1): 81-91 (1980) - [j11]Peter J. Slater:
Medians of arbitrary graphs. J. Graph Theory 4(4): 389-392 (1980)
1970 – 1979
- 1979
- [j10]Peter J. Slater:
Path coverings of the vertices of a tree. Discret. Math. 25(1): 65-74 (1979) - [j9]Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater:
Matchings and transversals in hypergraphs, domination and independence-in trees. J. Comb. Theory B 26(1): 78-80 (1979) - 1978
- [j8]Stephen B. Maurer, Peter J. Slater:
On k-minimally n-edge-connected graphs. Discret. Math. 24(2): 185-195 (1978) - [j7]Peter J. Slater:
Soldering and point splitting. J. Comb. Theory B 24(3): 338-343 (1978) - [j6]Peter J. Slater:
A constructive characterization of trees with at least k disjoint maximum matchings. J. Comb. Theory B 25(3): 326-338 (1978) - [j5]Peter J. Slater:
Centers to centroids in graphs. J. Graph Theory 2(3): 209-222 (1978) - 1977
- [j4]Stephen B. Maurer, Peter J. Slater:
On k-critical, n-connected graphs. Discret. Math. 20: 255-262 (1977) - 1976
- [j3]Peter J. Slater:
R-Domination in Graphs. J. ACM 23(3): 446-450 (1976) - [j2]Peter J. Slater, Seymour E. Goodman, Stephen T. Hedetniemi:
On the optional hamiltonian completion problem. Networks 6(1): 35-51 (1976) - 1975
- [j1]Seymour E. Goodman, Stephen T. Hedetniemi, Peter J. Slater:
Advances on the Hamiltonian Completion Problem. J. ACM 22(3): 352-360 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
