Abstract
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 S 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 γ p (G). We show that the problem of finding the power domination number for split graphs, a subclass of chordal graphs, is NP-complete. In addition, we present a linear time algorithm for finding γ p (G) of an interval graph G, if the interval ordering of the graph is provided, and show that the algorithm with O(nlog n) time complexity, is asymptotically optimal, if the interval ordering is not given, where n is the number of intervals. We also show that the same results hold for the class of proper circular-arc graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldwin, T.L., Mili, L., Boisen Jr., M.B., Adapa, R.: Power system observability with minimal phasor measurement placewement. IEEE Trans. Power Syst. 8(2), 707–715 (1993)
Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. 15th Annual Symp. on theory of Computing, pp. 80–86 (1983)
Chang, G.J.: Algorithmic aspects of domination in graphs. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. 339–405 (1998)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., London (1980)
Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15(4), 519–529 (2002)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: The Theory. Marcel Dekker, Inc., New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, Inc., New York (1998)
Hsu, W.-L., Tsai, K.-H.: Linear time algorithms on circular-arc graphs. Infrom. Process. Letter. 40, 123–129 (1991)
Liao, C.S., Chang, G.J.: Algorithmic aspect of k-tuple domination in graphs. Taiwanese J. Math. 6, 415–420 (2002)
Liao, C.S., Chang, G.J.: k-tuple domination in graphs, Inform. Process. Letter. 87, 45–50 (2003)
Liao, C.S., Lee, D.T.: Power domination problem in graphs, manuscript, Institute of Information Science. Academia Sinica (April 2005)
Lee, D.T., Sarrafzadeh, M., Wu, Y.F.: Minimum cuts for circular-arc graphs. SIAM J. Comput. 19(6), 1041–1050 (1990)
Ramalingam, G., Pandu Rangan, C.: A unified approach to domination problems in interval graphs. Inform. Process. Letter 27, 271–274 (1988)
Tsai, K.H., Lee, D.T.: k-Best Cuts for Circular-Arc Graphs. Algorithmica 18, 198–216 (1997)
Zhao, M., Kang, L., Chang, G.J.: Power domination in graphs, manuscript, Personal Communication
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liao, CS., Lee, DT. (2005). Power Domination Problem in Graphs. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_83
Download citation
DOI: https://doi.org/10.1007/11533719_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)