Peter J. Slater

CoRR, 2022

2017

Open-independent, open-locating-dominating sets.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2017

Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph.

[BibT_eX]

[DOI]

G. Sethuraman

P. Ragukumar

Discret. Math., 2017

2015

Fault tolerant detectors for distinquishing sets in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

2014

Centroidal bases in graphs.

[BibT_eX]

[DOI]

Florent Foucaud

Ralf Klasing

Networks, 2014

On open neighborhood locating-dominating in graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2014

A sharp lower bound for locating-dominating sets in trees.

[BibT_eX]

[DOI]

J. Louis Sewell

Australas. J Comb., 2014

2013

Uniqueness of Vertex Magic Constants.

[BibT_eX]

[DOI]

Allen O'Neal

SIAM J. Discret. Math., 2013

2011

An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin, and Spread.

[BibT_eX]

[DOI]

Allen O'Neal

Math. Comput. Sci., 2011

Distance independence in graphs.

[BibT_eX]

[DOI]

J. Louis Sewell

Discuss. Math. Graph Theory, 2011

Open neighborhood locating-dominating in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Open neighborhood locating-domination for infinite cylinders.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Southeast Regional Conference, 2011

2010

On locating-domination in graphs.

[BibT_eX]

[DOI]

Mustapha Chellali

Malika Mimouni

Discuss. Math. Graph Theory, 2010

Open neighborhood locating dominating sets.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

2009

Liar's domination.

[BibT_eX]

[DOI]

Networks, 2009

Liar's domination in graphs.

[BibT_eX]

[DOI]

Miranda L. Roden

Discret. Math., 2009

2008

Queen's domination using border squares and (A, B)-restricted domination.

[BibT_eX]

[DOI]

Anne Sinko

Discret. Math., 2008

2007

Efficient (j, k)-domination.

[BibT_eX]

[DOI]

Robert R. Rubalcaba

Discuss. Math. Graph Theory, 2007

Roman dominating influence parameters.

[BibT_eX]

[DOI]

Robert R. Rubalcaba

Discret. Math., 2007

2006

Competition-reachability of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2006

An introduction to proper-coupled-domination in graphs.

[BibT_eX]

[DOI]

Proceedings of the 44st Annual Southeast Regional Conference, 2006

2005

Trees with Equal Domination and Paired-domination Numbers.

[BibT_eX]

Ars Comb., 2005

An introduction to competition-reachability of a graph.

[BibT_eX]

[DOI]

Proceedings of the 43nd Annual Southeast Regional Conference, 2005

2004

An Introduction to Maximum Sum Permutations of Graphs.

[BibT_eX]

Steven J. Winters

Ars Comb., 2004

2003

H-domination in graphs.

[BibT_eX]

[DOI]

Khee Meng Koh

Bock Boom Lim

Discret. Math., 2003

Strong equality of domination parameters in trees.

[BibT_eX]

[DOI]

Discret. Math., 2003

H-forming sets in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

Distance and connectivity measures in permutation graphs.

[BibT_eX]

[DOI]

Wayne Goddard

Michael Edwin Raines

Discret. Math., 2003

Graphs of order n with locating-chromatic number n-1.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Fault-tolerant locating-dominating sets.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Average distance in colored graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Wayne Goddard

J. Graph Theory, 2001

1999

Center, median, and centroid subgraphs.

[BibT_eX]

[DOI]

Christian Smart

Networks, 1999

A survey of sequences of central subgraphs.

[BibT_eX]

[DOI]

Networks, 1999

Bounds on the Total Redundance and Efficiency of a Graph.

[BibT_eX]

Ars Comb., 1999

1998

Paired-domination in graphs.

[BibT_eX]

[DOI]

Networks, 1998

Parity dimension for graphs.

[BibT_eX]

[DOI]

Lane H. Clark

Discret. Math., 1998

Closed neighborhood order dominating functions.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

Fundamentals of domination in graphs.

[BibT_eX]

Pure and applied mathematics 208, Dekker, ISBN: 978-0-8247-0033-1, 1998

1996

Inequalities relating domination parameters in cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Generalized domination and efficient domination in graphs.

[BibT_eX]

[DOI]

Linda H. Host

Discret. Math., 1996

1995

The algorithmic complexity of signed domination in graphs.

[BibT_eX]

[DOI]

Johannes H. Hattingh

Australas. J Comb., 1995

1994

A Recurrence Template for Several Parameters in Series-parallel Graphs.

[BibT_eX]

[DOI]

Dana L. Grinstead

Discret. Appl. Math., 1994

Three-valued k-neighborhood domination in graphs.

[BibT_eX]

[DOI]

Johannes H. Hattingh

Australas. J Comb., 1994

1993

On uniformly optimally reliable graphs for pair-connected reliability with vertex failures.

[BibT_eX]

[DOI]

Kyle Siegrist

Networks, 1993

Efficient Edge Domination Problems in Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

The Optimal Unicyclic Graphs for Pair-Connected Reliability.

[BibT_eX]

[DOI]

Kyle Siegrist

Discret. Appl. Math., 1993

1991

On the nonexistence of uniformly optimal graphs for pair-connected reliability.

[BibT_eX]

[DOI]

Kyle Siegrist

Networks, 1991

Distinct distance sets in a graph.

[BibT_eX]

[DOI]

Richard A. Gibbs

Discret. Math., 1991

1990

On minimum dominating sets with minimum intersection.

[BibT_eX]

[DOI]

Dana L. Grinstead

Discret. Math., 1990

1987

Domination and location in acyclic graphs.

[BibT_eX]

[DOI]

Networks, 1987

Convex labelings of trees.

[BibT_eX]

[DOI]

Stephen J. Dow

Douglas F. Rall

J. Graph Theory, 1987

1986

On iterated clique graphs with increasing diameters.

[BibT_eX]

[DOI]

Claudine Peyrat

Douglas F. Rall

J. Graph Theory, 1986

A Linear Algorithm for the Cutting Center of a Tree.

[BibT_eX]

[DOI]

Frank Harary

Inf. Process. Lett., 1986

On k-graceful, countably infinite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1986

1985

Packing a tree with a graph of the same size.

[BibT_eX]

[DOI]

S. K. Teo

H. P. Yap

J. Graph Theory, 1985

A note on similar edges and edge-unique line graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

1983

On k-graceful, locally finite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Sequentially additive graphs.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

Counterexamples to randić's conjecture on distance degree sequences for trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1982

A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1981

Information Dissemination in Trees.

[BibT_eX]

[DOI]

Ernest J. Cockayne

SIAM J. Comput., 1981

The k-nucleus of a graph.

[BibT_eX]

[DOI]

Networks, 1981

On graphs containing a given graph as center.

[BibT_eX]

[DOI]

Fred Buckley

Zevi Miller

J. Graph Theory, 1981

On Locating a Facility to Service Areas within a Network.

[BibT_eX]

[DOI]

Oper. Res., 1981

On k-sequential and other numbered graphs.

[BibT_eX]

[DOI]

Discret. Math., 1981

Accretion centers: A generalization of branch weight centroids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

1980

Medians of arbitrary graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1980

Conservative graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1980

A Linear Algorithm for a Core of a Tree.

[BibT_eX]

[DOI]

Christine A. Morgan

J. Algorithms, 1980

1979

Matchings and transversals in hypergraphs, domination and independence-in trees.

[BibT_eX]

[DOI]

Ernest J. Cockayne

J. Comb. Theory B, 1979

Path coverings of the vertices of a tree.

[BibT_eX]

[DOI]

Discret. Math., 1979

1978

Centers to centroids in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1978

Soldering and point splitting.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

A constructive characterization of trees with at least k disjoint maximum matchings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

On k-minimally n-edge-connected graphs.

[BibT_eX]

[DOI]

Stephen B. Maurer

Discret. Math., 1978

1977

On k-critical, n-connected graphs.

[BibT_eX]

[DOI]

Stephen B. Maurer

Discret. Math., 1977

1976

On the optional hamiltonian completion problem.

[BibT_eX]

[DOI]

Seymour E. Goodman

Networks, 1976

R-Domination in Graphs.

[BibT_eX]

[DOI]

J. ACM, 1976

1975

Advances on the Hamiltonian Completion Problem.

[BibT_eX]

[DOI]

Seymour E. Goodman