The Graph Domination Applicable on Power System

• Main Author: 錢沛崗
• Other Authors: 賴泳伶
• Format: Others
• Language: en_US
• Online Access: http://ndltd.ncl.edu.tw/handle/00167740608691727952

碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 101 === Phase measurement units (PMU) placement problem is an important task for electric power company. This problem can be modeled by graphs as follows: Given an undirected graph , find a set with minimum cardinality such that all vertices in V are observed by some vertices in S. Herein, a vertex which is claimed to be a PMU observes itself and all its neighbors, and if an observed vertex has all but one of its neighbors observed, then the remaining neighbor becomes observed as well. The minimum cardinality of S for graph G is called power domination number and is denoted as . This thesis established the power domination number of Petersen graph, tensor product of a cycle with a cycle, and strong product of a cycle with either a cycle or a path.