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 graphs (see SIAM J. Discrete Math. 15(4) (2002), 519-529). A set S of vertices is defined to be a power dominating set of a graph 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. We investigate the power domination number of a block graph.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19454 |
| Date | 01 April 2006 |
| Creators | Atkins, David, Haynes, Teresa W., Henning, Michael A. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0016 seconds