{'fraction_non_alphanumeric': 0.030405405405405407, 'fraction_numerical': 0.0, 'mean_word_length': 4.647619047619048, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Power Domination on Block-cactus Graphs ∗

The problem of monitoring an electric power system is placing as few measurement devices as possible. In graph theoretical representation, it can be considered as a variant of domination problem, namely, power domination problem. This problem is to find a minimum power domination set S of a graph G = (V, E) with S ⊆ V and S can dominate all vertices and edges through the observation rules according to Kirchhoff’s current law and Ohm’s law. In this paper, we propose a lineartime algorithm for the power domination problem on block-cactus graphs.