Peter J. Slater

Computer Science · Physical Sciences

28h-index4.4kcitations120works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(87), Graph Labeling and Dimension Problems(49), Graph theory and applications(31), Complexity and Algorithms in Graphs(23), graph theory and CDMA systems(16)

Publications120 total

Graphical parameters for classes of tumbling block graphs
arXiv (Cornell University)·2022· 5 citedOpen Access
Colored Problems in Graphs
AKCE International Journal of Graphs and Combinatorics·2020· 1 citedOpen Access
A survey on graphs which have equal domination and closed neighborhood packing numbers
AKCE International Journal of Graphs and Combinatorics·2020· 10 citedOpen Access
Open-independent, open-locating-dominating sets
Electronic Journal of Graph Theory and Applications·2017· 9 citedOpen Access
Any Tree with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml9" display="inline" overflow="scroll" altimg="si9.gif"><mml:mi>m</mml:mi></mml:math> edges can be embedded in a Graceful Tree with less than <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml10" display="inline" overflow="scroll" altimg="si10.gif"><mml:mn>4</mml:mn><mml:mi>m</mml:mi></mml:math> edges and in a graceful planar graph
Discrete Mathematics·2016· 4 cited
It Is All Labeling
Problem books in mathematics·2016· 2 cited
Embedding an Arbitrary Tree in a Graceful Tree
Bulletin of the Malaysian Mathematical Sciences Society·2015· 2 cited
Fault tolerant detectors for distinquishing sets in graphs
Discussiones Mathematicae Graph Theory·2015· 9 citedOpen Access
Centroidal bases in graphs
Networks·2014· 6 citedOpen Access
Uniqueness of Vertex Magic Constants
SIAM Journal on Discrete Mathematics·2013· 25 cited
AN INTRODUCTION TO DISTANCE &lt;I&gt;D&lt;/I&gt; MAGIC GRAPHS
Journal of the Indonesian Mathematical Society·2012· 13 citedOpen Access
HOW PROVABLY GRACEFUL ARE THE TREES?
Journal of the Indonesian Mathematical Society·2012· 1 citedOpen Access
Open neighborhood locating-domination for infinite cylinders
2011· 6 cited
An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin, and Spread
Mathematics in Computer Science·2011· 3 cited
Open neighborhood locating–dominating in trees
Discrete Applied Mathematics·2011· 51 cited
Distance independence in graphs
Discussiones Mathematicae Graph Theory·2011Open Access
The graph distance game
2011· 1 cited
On locating-domination in graphs
Discussiones Mathematicae Graph Theory·2010· 8 citedOpen Access
Open neighborhood locating dominating sets.
2010· 69 cited
Liar's domination
Networks·2009· 22 citedOpen Access
page 1 of 6Next →

Frequent Co-authors

Stephen T. Hedetniemi(5), Michael A. Henning(5), Teresa W. Haynes(4), Dana L. Grinstead(3), Ashok T. Amin(3), E. J. Cockayne(2), Suk J. Seo(2), David W. Bange(2), Anthony E. Barkauskas(2), Václav Chvátal(1), Christine A Morgan(1), Fred Buckley(1), Zevi Miller(1), Naveed A. Sherwani(1), N.D. Holmes(1), Carmen Hernando(1), Mercè Ferrater Mora(1), David R. Wood(1), Gary Chartrand(1), David Erwin(1)