{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:49:38Z","timestamp":1771706978407,"version":"3.50.1"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,3]]},"abstract":"<jats:p> To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in graph theory. A set P is a power dominating set (PDS) of a graph G = (V, E), if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of a PDS of a graph G is the power domination number \u03b3<jats:sub>p<\/jats:sub>(G). In this paper, we determine the upper bounds of power domination number of generalized undirected de Bruijn graphs and generalized undirected Kautz graphs. <\/jats:p>","DOI":"10.1142\/s1793830915500032","type":"journal-article","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T07:52:02Z","timestamp":1418111522000},"page":"1550003","source":"Crossref","is-referenced-by-count":3,"title":["Power domination in generalized undirected de Bruijn graphs and Kautz graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"Jyhmin","family":"Kuo","sequence":"first","affiliation":[{"name":"Chen-Te Senior High School, Hsin Chu 30047, Taiwan"}]},{"given":"Wei-Lun","family":"Wu","sequence":"additional","affiliation":[{"name":"Chen-Te Senior High School, Hsin Chu 30047, Taiwan"}]}],"member":"219","published-online":{"date-parts":[[2015,2,2]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/59.260810"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00130-8"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00436-3"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.01.014"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100375831"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676323"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00479-9"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/12.805162"},{"key":"rf12","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:25:32Z","timestamp":1565151932000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,2]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2015,2,2]]},"published-print":{"date-parts":[[2015,3]]}},"alternative-id":["10.1142\/S1793830915500032"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500032","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,2]]}}}