The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter J. Slater: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Suk Jai Seo, Peter J. Slater
    An introduction to proper-coupled-domination in graphs. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 2006, pp:265-270 [Conf]
  2. Suk Jai Seo, Peter J. Slater
    An introduction to competition-reachability of a graph. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference (1), 2005, pp:121-125 [Conf]
  3. Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
    Bounds on the Total Redundance and Efficiency of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  4. Teresa W. Haynes, Michael A. Henning, Peter J. Slater
    Trees with Equal Domination and Paired-domination Numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  5. Peter J. Slater, Steven J. Winters
    An Introduction to Maximum Sum Permutations of Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  6. Dana L. Grinstead, Peter J. Slater
    A Recurrence Template for Several Parameters in Series-parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:151-168 [Journal]
  7. Kyle Siegrist, Ashok T. Amin, Peter J. Slater
    The Optimal Unicyclic Graphs for Pair-Connected Reliability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:41, n:3, pp:235-243 [Journal]
  8. Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang
    Graphs of order n with locating-chromatic number n-1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:65-79 [Journal]
  9. Wayne Goddard, Michael Edwin Raines, Peter J. Slater
    Distance and connectivity measures in permutation graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:61-70 [Journal]
  10. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater
    H-forming sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:159-169 [Journal]
  11. Teresa W. Haynes, Michael A. Henning, Peter J. Slater
    Strong equality of domination parameters in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:77-87 [Journal]
  12. Khee Meng Koh, Bock Boom Lim, Peter J. Slater
    H-domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:97-105 [Journal]
  13. Suk Jai Seo, Peter J. Slater
    Competition-reachability of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:580-590 [Journal]
  14. Peter J. Slater
    Fault-tolerant locating-dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:179-189 [Journal]
  15. Dana L. Grinstead, Peter J. Slater, Naveed A. Sherwani, Nancy D. Holmes
    Efficient Edge Domination Problems in Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:5, pp:221-228 [Journal]
  16. Frank Harary, Peter J. Slater
    A Linear Algorithm for the Cutting Center of a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:6, pp:317-319 [Journal]
  17. Peter J. Slater
    A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:4, pp:186-188 [Journal]
  18. S. E. Goodman, Stephen T. Hedetniemi, Peter J. Slater
    Advances on the Hamiltonian Completion Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:3, pp:352-360 [Journal]
  19. Peter J. Slater
    R-Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:446-450 [Journal]
  20. Christine A. Morgan, Peter J. Slater
    A Linear Algorithm for a Core of a Tree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1980, v:1, n:3, pp:247-258 [Journal]
  21. David W. Bange, Anthony E. Barkauskas, Peter J. Slater
    A note on similar edges and edge-unique line graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:31-40 [Journal]
  22. Peter J. Slater
    On k-graceful, locally finite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:319-322 [Journal]
  23. Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
    Matchings and transversals in hypergraphs, domination and independence-in trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:78-80 [Journal]
  24. Peter J. Slater
    A constructive characterization of trees with at least k disjoint maximum matchings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:326-338 [Journal]
  25. Peter J. Slater
    Soldering and point splitting. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:3, pp:338-343 [Journal]
  26. Teresa W. Haynes, Peter J. Slater
    Paired-domination in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:3, pp:199-206 [Journal]
  27. Peter J. Slater
    A survey of sequences of central subgraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:244-249 [Journal]
  28. Christian Smart, Peter J. Slater
    Center, median, and centroid subgraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:303-311 [Journal]
  29. Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
    Information Dissemination in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:692-701 [Journal]
  30. Peter J. Slater
    On k-sequential and other numbered graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:2, pp:185-193 [Journal]
  31. David W. Bange, Anthony E. Barkauskas, Peter J. Slater
    Sequentially additive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:235-241 [Journal]
  32. Peter J. Slater
    On k-graceful, countably infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:293-303 [Journal]
  33. Ashok T. Amin, Lane H. Clark, Peter J. Slater
    Parity dimension for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:1-17 [Journal]
  34. Dana L. Grinstead, Peter J. Slater
    On minimum dominating sets with minimum intersection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:239-254 [Journal]
  35. Richard A. Gibbs, Peter J. Slater
    Distinct distance sets in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:93, n:2-3, pp:155-165 [Journal]
  36. Michael A. Henning, Peter J. Slater
    Inequalities relating domination parameters in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:158, n:1-3, pp:87-98 [Journal]
  37. David W. Bange, Anthony E. Barkauskas, Linda H. Host, Peter J. Slater
    Generalized domination and efficient domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:1-11 [Journal]

  38. Roman dominating influence parameters. [Citation Graph (, )][DBLP]


  39. Queen's domination using border squares and (A, B)-restricted domination. [Citation Graph (, )][DBLP]


  40. Liar's domination in graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002