Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Locating-Domination"”.

  1. Locating-Domination in Complementary Prisms.

    … vertices of G and G̅. A set D ⊆ V (G) is a locating-dominating set of G if for every u ∈ V (G)D, its neighborhood N(u)⋂D is nonempty and distinct from N(v)⋂D for all v ∈ V (G)D where v ≠ u. The locating-domination number of G is the minimum cardinality of a locating-dominating set of G. In …

    etsu Repository record for Locating-Domination in Complementary Prisms. (opens in a new tab) Download PDF for Locating-Domination in Complementary Prisms. (opens in a new tab)

  2. The i-Graph and Other Variations on the γ-Graph

    … γ-graph including those using identifying codes, locating-domination, total-domination, paired-domination, and the upper domination number. For each, we show that for any graph H, there exist infinitely many graphs whose γ-graph variant is isomorphic to H. The independent domination number i(G) is …

    uvic Repository record for The i-Graph and Other Variations on the γ-Graph (opens in a new tab)

  3. 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 …

    etsu Repository record for Trees with Unique Minimum Locating-Dominating Sets. (opens in a new tab) Download PDF for Trees with Unique Minimum Locating-Dominating Sets. (opens in a new tab)