Trees with Unique Minimum Locating-Dominating Sets.

A set S of vertices in a graph G = (V, E) is a locating-dominating set if S is a dominating set of G, and every pair of distinct vertices {u, v} in V - S is located with respect to S, that is, if the set of neighbors of u that are in S is not equal to the set of neighbors of v that are in S. We give...

Full description

Bibliographic Details
Main Author:	Lane, Stephen M
Format:	Others
Published:	Digital Commons @ East Tennessee State University 2006
Subjects:	locating-domination locating-dominating set Discrete Mathematics and Combinatorics Mathematics Physical Sciences and Mathematics
Online Access:	https://dc.etsu.edu/etd/2196 https://dc.etsu.edu/cgi/viewcontent.cgi?article=3560&context=etd

id	ndltd-ETSU-oai-dc.etsu.edu-etd-3560
record_format	oai_dc
spelling	ndltd-ETSU-oai-dc.etsu.edu-etd-35602019-05-16T04:43:27Z Trees with Unique Minimum Locating-Dominating Sets. Lane, Stephen M A set S of vertices in a graph G = (V, E) is a locating-dominating set if S is a dominating set of G, and every pair of distinct vertices {u, v} in V - S is located with respect to S, that is, if the set of neighbors of u that are in S is not equal to the set of neighbors of v that are in S. We give a construction of trees that have unique minimum locating-dominating sets. 2006-05-06T07:00:00Z text application/pdf https://dc.etsu.edu/etd/2196 https://dc.etsu.edu/cgi/viewcontent.cgi?article=3560&context=etd Copyright by the authors. Electronic Theses and Dissertations Digital Commons @ East Tennessee State University locating-domination locating-dominating set Discrete Mathematics and Combinatorics Mathematics Physical Sciences and Mathematics
collection	NDLTD
format	Others
sources	NDLTD
topic	locating-domination locating-dominating set Discrete Mathematics and Combinatorics Mathematics Physical Sciences and Mathematics
spellingShingle	locating-domination locating-dominating set Discrete Mathematics and Combinatorics Mathematics Physical Sciences and Mathematics Lane, Stephen M Trees with Unique Minimum Locating-Dominating Sets.
description	A set S of vertices in a graph G = (V, E) is a locating-dominating set if S is a dominating set of G, and every pair of distinct vertices {u, v} in V - S is located with respect to S, that is, if the set of neighbors of u that are in S is not equal to the set of neighbors of v that are in S. We give a construction of trees that have unique minimum locating-dominating sets.
author	Lane, Stephen M
author_facet	Lane, Stephen M
author_sort	Lane, Stephen M
title	Trees with Unique Minimum Locating-Dominating Sets.
title_short	Trees with Unique Minimum Locating-Dominating Sets.
title_full	Trees with Unique Minimum Locating-Dominating Sets.
title_fullStr	Trees with Unique Minimum Locating-Dominating Sets.
title_full_unstemmed	Trees with Unique Minimum Locating-Dominating Sets.
title_sort	trees with unique minimum locating-dominating sets.
publisher	Digital Commons @ East Tennessee State University
publishDate	2006
url	https://dc.etsu.edu/etd/2196 https://dc.etsu.edu/cgi/viewcontent.cgi?article=3560&context=etd
work_keys_str_mv	AT lanestephenm treeswithuniqueminimumlocatingdominatingsets
_version_	1719188207853109248

Trees with Unique Minimum Locating-Dominating Sets.

Similar Items