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 2 of 2 for “"bad vertices"”.

  1. Vertices in Total Dominating Sets.

    … denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called …

    etsu Repository record for Vertices in Total Dominating Sets. (opens in a new tab) Download PDF for Vertices in Total Dominating Sets. (opens in a new tab)

  2. Explorations in the Classification of Vertices as Good or Bad.

    … dominating set is called good; otherwise it is bad. A graph G has g(G) good vertices and b(G) bad vertices. The relationship between the order of G and g(G) assigns the graph to one of four classes. Our results include a method of classifying caterpillars. Further, we develop realizability …

    etsu Repository record for Explorations in the Classification of Vertices as Good or Bad. (opens in a new tab) Download PDF for Explorations in the Classification of Vertices as Good or Bad. (opens in a new tab)