The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graph theory. A set S 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 S (following a set of rules for power system monitoring). The minimum cardinality of a power dominating set of a graph is its power domination number. In this thesis, we investigate the power domination number of a block graph.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etd-1951 |
| Date | 11 August 2003 |
| Creators | Atkins, David Wayne |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Electronic Theses and Dissertations |
| Rights | Copyright by the authors. |
Page generated in 0.0021 seconds