$$k$$ k -Power domination in block graphs

Chao Wang, Lei Chen and Changhong Lu ()
Additional contact information
Chao Wang: East China Normal University
Lei Chen: Shanghai Maritime University
Changhong Lu: East China Normal University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 2, No 25, 865-873

Abstract: Abstract The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating set in graphs. The concept of $$k$$ k -power domination, first introduced by Chang et al. (Discret Appl Math 160:1691–1698, 2012), is a common generalization of domination and power domination. In this paper, we present a linear-time algorithm for $$k$$ k -power domination in block graphs.

Keywords: Domination; Power domination; Electrical network monitoring; Block graphs; 05C69; 05C85; 68R10 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9795-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9795-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9795-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().