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 “"Block Graph"”.

  1. Placing Monitoring Devices in Electric Power Networks Modeled by Block Graphs.

    … vertex covering and dominating set problems in graph theory. A set <em>S</em> of vertices is defined to be a power dominating set of a graphs if every vertex and every edge in the system is monitored by the set <em>S</em> (following a set of rules for power system monitoring). The minimum …

    etsu Repository record for Placing Monitoring Devices in Electric Power Networks Modeled by Block Graphs. (opens in a new tab)

  2. Multiple domination in graphs

    Given an undirected and simple graph G = (V , E), a subset D of the vertex set is called a k-dominating set if every vertex not in D has at least k neighbors in D. This concept was introduced by Fink and Jacobson in the year 1985, generalizing the already much studied concept of domination in …

    aachen Repository record for Multiple domination in graphs (opens in a new tab)