NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.129 seconds)

Spelling suggestions: "subject:"locatingthe domination set"" "subject:"locatingone domination set""

1

Locating and Total Dominating Sets in Trees

Haynes, Teresa W., Henning, Michael A., Howard, Jamie 01 May 2006 (has links)
A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
differentiating-total dominating set
locating-total dominating set
metric-locating-total dominating set
Curriculum and Instruction
Early Childhood Education
2

Locating and Total Dominating Sets in Trees.

Howard, Jamie Marie 01 May 2004 (has links) (PDF)
A set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
differentiating total dominating set
locating-total dominating set
Physical Sciences and Mathematics

Page generated in 0.1383 seconds