Fault-tolerance amplification in line graphs: a framework for resilient PMU placement in power networks Authors: Lakshmi Girish, Ahmad Asiri, K. Somasundaram Published: 2026 ABSTRACT The placement of Phasor Measurement Units (PMUs) is fundamental to achieving reliable observability in electric power networks, especially when measurements are subject to hardware failures or communication outages. Motivated by the need to understand how robustness behaves under different network representations, this paper studies the k-fault tolerant power domination number \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^k(G)$$\end{document} under the line graph transformation L(G). In this paper, we establish a correspondence between power domination in a graph and the induced monitoring process in its line graph, thereby linking vertex-based and edge-based perspectives on network observability. Within this dual framework, we prove the Fault-Tolerance Amplification Theorem, which states that if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is a k-fault tolerant power dominating set of G, then the induced set in L(G) is Q-fault tolerant, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k \le Q \le \left( \sum _{i=1}^{k+1} d(v_i)\right) -1,$$\end{document}and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d(v_1)\le \dots \le d(v_{k+1})$$\end{document} are the k+1 smallest degrees among the vertices of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. And Q attains its upper bound when \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is an independent k-fault tolerant power dominating set of G. These results provide a topology-aware framework for resilient PMU placement, clarifying when degree-based fault-tolerance amplification is valid and highlighting structural conditions under which additional care is required. We have validated our results with IEEE bus systems. Introduction The strategic placement of devices known as Phasor Measurement Units (PMUs) is a fundamental requirement to achieve real time observability of the system state in modern power systems1,2. This problem was first formalised in graph-theoretic terms through the notion of power domination, introduced by Haynes et al.3. The power domination problem identifies a minimum set of sensors that can monitor an entire network. As power grids are becoming more complex with increasingly interconnected smart infrastructures, the vulnerability of monitoring configurations to hardware malfunctions, communication failures, and maintenance outages has become a critical concern. To address these challenges, recent studies have focused on improving resilience through the concept of k- fault tolerant power domination4. This parameter guarantees that network observability is preserved even after the failure of any k sensors within a power dominating set. While fault tolerant power domination has been investigated for several standard grid benchmarks and classes of graphs5–7, existing approaches are predominantly centered on bus-based (vertex) monitoring. However, in practice, deployment constraints and measurement requirements often motivate edge-based monitoring strategies, in which sensors are associated with transmission lines rather than buses. Despite the successful use of structural decomposition techniques to bound domination parameters in specific network topologies8, the behaviour of fault tolerance under dual graph representations has received comparatively little attention. In particular, the effect of the line graph transformation on fault tolerant power domination remains poorly understood. Existing PMU placement and fault tolerant monitoring methods exhibit two important limitations in this context. First, most works focus on bus?based (vertex) observability and either ignore or only implicitly address the induced behaviour of edge?based (line) monitoring configurations. Second, current fault tolerant PMU placement formulations optimise sensor locations directly on the original network, without providing structural guarantees on how the achievable fault tolerance changes when the network is represented by its line graph L(G). Consequently, the impact of line graph transformations on k-fault tolerant power domination is not yet systematically understood. This paper addresses this gap by developing a topology?aware framework for fault tolerance amplification in line graphs. Our main contributions are: (i) we establish a precise correspondence between a power dominating set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G \subseteq V(G)$$\end{document} and the induced monitoring process in L(G), thereby linking vertex?based and edge?based perspectives of observability; (ii) we prove the Fault?Tolerance Amplification Theorem, which shows that every k-fault tolerant power dominating set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} induces a Q-fault tolerant monitoring set in L(G) with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k \le Q \le \left( \sum _{i=1}^{k+1} d(v_i)\right) -1$$\end{document}, and we characterize when this upper bound is attained; and (iii) we validate the framework on standard IEEE bus systems and provide simple algorithmic procedures for constructing independent PMU configurations and verifying their fault tolerance in both G and L(G). In particular, the Fault Tolerance Amplification Theorem makes the impact of line graph transformation explicit by quantifying how the degrees of vertices in a k-FPDS control the achievable fault tolerance in L(G). It is to be noted that the present work focuses on fault tolerance amplification under the line graph transformation rather than on minimum-cardinality PMU placement. Existing PMU placement methods in the literature pursue optimal observability through graph-theoretic and optimisation-based criteria, whereas our objective is to analyse how a given independent PMU configuration behaves under fault tolerance in the induced line-graph setting. Power domination in line graphs Let G=(V(G), E(G)) be a finite simple graph. A set S ⊆ V(G) is called a k-fault tolerant power dominating set (k-FPDS) of G if, for every subset F ⊆ S with |F| łe k, the set S ∖ F remains a power dominating set of G. The k-fault tolerant power domination number of G, denoted by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{P}^{k}(G)$$\end{document}, is the minimum cardinality of a k-FPDS of G. When k = 0, the definition recovers the classical power domination number, that is, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{P}^{0}(G)=\gamma _{P}(G)$$\end{document}. Throughout the paper, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)$$\end{document} denotes the classical power domination number of a graph G, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^k(G)$$\end{document} denotes its k-fault tolerant power domination number. A k-fault tolerant power dominating set is abbreviated as k-FPDS. Given a k-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G \subseteq V(G)$$\end{document}, we write\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} = \bigcup _{v \in S_G} V(K_v)$$\end{document}for the induced monitoring set in the line graph L(G). IEEE test systems To examine the effectiveness of the k-fault tolerant model, we apply it to standard benchmarks, namely the IEEE 14-bus and IEEE 30-bus systems. These examples demonstrate how propagation can recover after a sensor failure when the monitoring set is appropriately constructed. Example 1 (IEEE 14-Bus System) The IEEE 14-bus system is shown in Fig. 1. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,4,6,13\}$$\end{document} be a candidate for a 1-fault tolerant power dominating set. To verify this, we must ensure that the failure of any single vertex in S does not interrupt the monitoring of the remaining vertices. That is, we analyse each of the four possible single-vertex failure scenarios. In each case, Table 1 illustrates the vertices monitored during the initial domination stage and traces the propagation sequence through which full network observability is recovered. Fig. 1IEEE 14 bus system. Table 1Domination and propagation steps for 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,4,6,13\}$$\end{document} (IEEE 14-Bus).Fault ScenarioInitial Monitored Set (via Domination)Propagat- ion Step 1Propagat- ion Step 2Propagat- ion Step 3 Fail 2 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,3,4,5,6, 7,9,11,12,13,14\}$$\end{document} 9 → 10, 5 → 1 (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{4,6,13\}$$\end{document}) 7 → 8 5 → 1 Fail 4 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,3,4, 5,6, 11,12,13,14\}$$\end{document} 14 → 9, 9 → 7 7 → 8 (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,13\}$$\end{document}) 11 → 10 Fail 6 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,3,4,5,6, 7,9,12,13,14\}$$\end{document} 9 → 10,(\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,4,13\}$$\end{document})6 → 11, 7 → 8 Fail 13 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,3,4,5,6,7,9,11,12,13\}$$\end{document} 11 → 10,(\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,4,6\}$$\end{document})13 → 14,7 → 8, IEEE 14 bus system. Table 1Domination and propagation steps for 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,4,6,13\}$$\end{document} (IEEE 14-Bus).Fault ScenarioInitial Monitored Set (via Domination)Propagat- ion Step 1Propagat- ion Step 2Propagat- ion Step 3 Fail 2 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,3,4,5,6, 7,9,11,12,13,14\}$$\end{document} 9 → 10, 5 → 1 (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{4,6,13\}$$\end{document}) 7 → 8 5 → 1 Fail 4 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,3,4, 5,6, 11,12,13,14\}$$\end{document} 14 → 9, 9 → 7 7 → 8 (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,13\}$$\end{document}) 11 → 10 Fail 6 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,3,4,5,6, 7,9,12,13,14\}$$\end{document} 9 → 10,(\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,4,13\}$$\end{document})6 → 11, 7 → 8 Fail 13 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,3,4,5,6,7,9,11,12,13\}$$\end{document} 11 → 10,(\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,4,6\}$$\end{document})13 → 14,7 → 8, Domination and propagation steps for 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,4,6,13\}$$\end{document} (IEEE 14-Bus). Example 2 (IEEE 30-Bus System) In the IEEE 30-bus system, shown in Fig. 2, the requirement of 1-fault tolerance typically necessitates a larger monitoring set, such as \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,6,10,12,24,27, 30\}$$\end{document}. Table 2 explicitly tracks the monitoring process corresponding to each single-vertex failure scenario. Fig. 2IEEE 30 bus system. Table 2Exhaustive monitoring propagation for 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,6,10,12,24,27, 30\}$$\end{document} (IEEE 30-Bus).Fault ScenarioInitial Monitored Set (Domination)Propagation Steps Fail 2 2, 4, 6, 7, 8, 9, 10, 12, 13, 14, 4 → 3, 7→ 5, 25 → 26, 9 → 11, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{6,10,12,24,27, 30\}$$\end{document} 15, 16, 17, 20, 21, 22, 23, 24, 15 → 18, 3 → 1, 18 → 19.25, 27, 28, 29, 30 Fail 6 1, 2, 4, 5, 6, 9, 10, 12, 13, 14, 1 → 3, 5 → 7, 28 → 8, 9 → 11, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,10,12,24,27, 30\}$$\end{document} 15, 16, 17, 20, 21, 22, 23, 24, 15 → 18, 20 → 19, 25 → 2625, 27, 28, 29, 30 Fail 10 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 1 → 3, 22 → 21, 16 → 17, 9 → 11, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,12,24,27, 30\}$$\end{document} 14, 15, 16, 22, 23, 24, 25, 27, 15 → 18, 25 → 26, 18 → 19,28, 29, 30 10 → 20 Fail 12 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 1 → 3, 9 → 11, 4 → 12, 17 → 16, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,24,27, 30\}$$\end{document} 17, 20, 21, 22, 23, 24, 20 → 19, 25 → 26, 19 → 18,25, 27, 28, 29, 3018 → 15, 15 → 14, 12 → 13 Fail 24 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 1 → 3, 9 → 11, 20 → 19, 19 → 18, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,12,27, 30 \}$$\end{document} 13, 14, 15, 16, 17, 20, 21, 22, 15 → 23, 23 → 24, 25 → 2625, 27, 28, 29, 30 Fail 27 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 1 → 3, 9 → 11, 15 → 18, 20 → 19, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,12,24, 30\}$$\end{document} 13, 14, 15, 16, 17, 20, 22, 28 → 27, 10 → 21, 25 → 2623, 24, 25, 28, 29, 30 Fail 30 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 1 → 3, 9 → 11, 20 → 19, 19 → 18, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,12, 24, 27\}$$\end{document} 13, 14, 15, 16, 17, 20, 21, 22, 15 → 23, 23 → 24, 25 → 2623, 25, 27, 28, 29, 30 IEEE 30 bus system. Table 2Exhaustive monitoring propagation for 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,6,10,12,24,27, 30\}$$\end{document} (IEEE 30-Bus).Fault ScenarioInitial Monitored Set (Domination)Propagation Steps Fail 2 2, 4, 6, 7, 8, 9, 10, 12, 13, 14, 4 → 3, 7→ 5, 25 → 26, 9 → 11, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{6,10,12,24,27, 30\}$$\end{document} 15, 16, 17, 20, 21, 22, 23, 24, 15 → 18, 3 → 1, 18 → 19.25, 27, 28, 29, 30 Fail 6 1, 2, 4, 5, 6, 9, 10, 12, 13, 14, 1 → 3, 5 → 7, 28 → 8, 9 → 11, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,10,12,24,27, 30\}$$\end{document} 15, 16, 17, 20, 21, 22, 23, 24, 15 → 18, 20 → 19, 25 → 2625, 27, 28, 29, 30 Fail 10 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 1 → 3, 22 → 21, 16 → 17, 9 → 11, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,12,24,27, 30\}$$\end{document} 14, 15, 16, 22, 23, 24, 25, 27, 15 → 18, 25 → 26, 18 → 19,28, 29, 30 10 → 20 Fail 12 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 1 → 3, 9 → 11, 4 → 12, 17 → 16, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,24,27, 30\}$$\end{document} 17, 20, 21, 22, 23, 24, 20 → 19, 25 → 26, 19 → 18,25, 27, 28, 29, 3018 → 15, 15 → 14, 12 → 13 Fail 24 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 1 → 3, 9 → 11, 20 → 19, 19 → 18, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,12,27, 30 \}$$\end{document} 13, 14, 15, 16, 17, 20, 21, 22, 15 → 23, 23 → 24, 25 → 2625, 27, 28, 29, 30 Fail 27 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 1 → 3, 9 → 11, 15 → 18, 20 → 19, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,12,24, 30\}$$\end{document} 13, 14, 15, 16, 17, 20, 22, 28 → 27, 10 → 21, 25 → 2623, 24, 25, 28, 29, 30 Fail 30 1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 1 → 3, 9 → 11, 20 → 19, 19 → 18, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S'=\{2,6,10,12, 24, 27\}$$\end{document} 13, 14, 15, 16, 17, 20, 21, 22, 15 → 23, 23 → 24, 25 → 2623, 25, 27, 28, 29, 30 Exhaustive monitoring propagation for 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\{2,6,10,12,24,27, 30\}$$\end{document} (IEEE 30-Bus). The previous examples focus on node-based monitoring; we now transition to the dual representation. In the line graph L(G), the monitoring process shifts from vertices to edges, corresponding to transmission lines in the power network. The line graph L(G) has vertex set E(G), two vertices of L(G) are adjacent exactly when the corresponding edges of G share an endpoint. For v∈ V(G), denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v \;=\; \{\, e\in E(G): v\in e \,\}$$\end{document}, the clique of L(G) formed by edges incident to v. Thus \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|K_v|=\deg _G(v)$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_u\cap K_v=\{uv\}$$\end{document} when uv∈ E(G). Recall that a set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G\subseteq V(G)$$\end{document} is a power dominating set (PDS) of G if the usual domination followed by propagation rules monitors every vertex of G starting from PMUs placed at \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. If removal of at most k vertices from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} leaves a PDS, we call \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} a k-fault tolerant power dominating set (abbreviated k-FPDS). Given \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G\subseteq V(G)$$\end{document}, we define its incident-edge set of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in L(G) as the set of vertices corresponding to edges incident to vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, denoted by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} \;=\; \bigcup _{v\in S_G} V(K_v) \subseteq V(L(G))$$\end{document}. Definition 1 (Power Domination Sequence) Let S be a PDS of graph G, and let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_0=N[S]$$\end{document} be the vertices monitored after the domination step. A sequence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(u_1\!\rightarrow v_1,\dots ,u_k\!\rightarrow v_k)$$\end{document} is a Power Domination Sequence if, for each step j, the vertex \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u_j$$\end{document} lies in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_{j-1}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_j$$\end{document} is its unique unmonitored neighbour. Hence, at step j, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u_j$$\end{document} can propagate to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_j$$\end{document}, and after the final step, every vertex of G is monitored. Observation: Suppose \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_v)\subseteq S_{L(G)}$$\end{document} and fewer than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d(v)=\deg _G(v)$$\end{document} faults occur inside \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document}. Then, after the domination step, the whole clique \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document} is monitored. This is because if fewer than d(v) PMUs in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document} fail, at least one functioning PMU remains at some vertex \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x\in K_v$$\end{document}. At the domination step, that PMU monitors x and all its neighbours in L(G); because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document} is a clique, every vertex of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document} is adjacent to x and thus becomes monitored. Theorem 2.1 Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{G} \subseteq V(G)$$\end{document} be a power dominating set of G. Then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} = \bigcup _{v\in S_{G}} V(K_{v}) \subseteq V(L(G))$$\end{document} is a power dominating set of the line graph L(G). Proof Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(u_1 \rightarrow v_1, u_2 \rightarrow v_2, \dots , u_n \rightarrow v_n)$$\end{document} be a valid power domination sequence in G, where for each step i, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u_i \in M_{i-1}^G$$\end{document} forces its unique unmonitored neighbour \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_i \notin M_{i-1}^G$$\end{document}, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_n^G = V(G)$$\end{document}. We prove by induction on these forcing steps that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} monitors all vertices of L(G). 1. Base Case: Domination Step Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_0^G = N_G[S_G]$$\end{document} be the initially monitored set in G. In the line graph L(G), let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_0^{L(G)} = N_{L(G)}[S_{L(G)}]$$\end{document} be the initially monitored set. 2. Inductive Hypothesis Assume that after the first k < n forcing steps in G, all edges incident to vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_k^G = \{u_1, v_1, \dots , u_k, v_k\} \cup S_G$$\end{document} are monitored in L(G). 3. Inductive Step: (k+1)-st forcing u → v Consider the (k+1)-st step where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u = u_{k+1} \in M_k^G$$\end{document} forces \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v = v_{k+1} \notin M_k^G$$\end{document}. Let e=(u,v) ∈ E(G) be the forcing edge, so e ∈ V(L(G)) is currently unmonitored. Claim: In L(G), there exists a monitored vertex f adjacent to e such that f has exactly one unmonitored neighbour: e. The neighbours of e in L(G) are:Edges incident to u except e: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_u) \setminus \{e\}$$\end{document}Edges incident to v except e: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_v) \setminus \{e\}$$\end{document}Step 3.1: Identifying f. Pick any neighbour \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z \in N_G(u) \setminus \{v\}$$\end{document}. The edge f = (u, z) exists in G. Since u forces v uniquely, z must already be in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_k^G$$\end{document}. Because both endpoints \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u, z \in M_k^G$$\end{document}, the Inductive Hypothesis implies that the vertex f = (u, z) is monitored in L(G). Edges incident to u except e: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_u) \setminus \{e\}$$\end{document} Edges incident to u except e: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_u) \setminus \{e\}$$\end{document} Edges incident to v except e: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_v) \setminus \{e\}$$\end{document} Edges incident to v except e: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(K_v) \setminus \{e\}$$\end{document} Step 3.2: Neighbours of f in L(G). The neighbors of f = (u, z) in L(G) are all edges incident to u or z (excluding f itself). Step 3.3: Verifying the forcing condition. We show that e is the unique unmonitored neighbour of f:Any edge f' = (u, z') where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z' \in N_G(u) \setminus \{v, z\}$$\end{document} connects two vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_k^G$$\end{document}, and is thus monitored.Any edge g = (z, w) where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w \in N_G(z)$$\end{document} is monitored because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z \in M_k^G$$\end{document} and the forcing condition in G ensures its neighbors are already observed.Step 3.4: Propagation. Since f is monitored and all its neighbours in L(G) are already monitored except for the forcing edge e=(u, v), the unique neighbour condition for power domination is satisfied. Therefore, f forces e in L(G), and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e \in M_{k+1}^{L(G)}$$\end{document}. Any edge f' = (u, z') where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z' \in N_G(u) \setminus \{v, z\}$$\end{document} connects two vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_k^G$$\end{document}, and is thus monitored. Any edge f' = (u, z') where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z' \in N_G(u) \setminus \{v, z\}$$\end{document} connects two vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_k^G$$\end{document}, and is thus monitored. Any edge g = (z, w) where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w \in N_G(z)$$\end{document} is monitored because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z \in M_k^G$$\end{document} and the forcing condition in G ensures its neighbors are already observed. Any edge g = (z, w) where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w \in N_G(z)$$\end{document} is monitored because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z \in M_k^G$$\end{document} and the forcing condition in G ensures its neighbors are already observed. Step 3.5: Clique completion. Once e=(u, v) is monitored, the internal clique propagation in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document} ensures all other edges incident to v become monitored. Thus, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_{k+1}^{L(G)}$$\end{document} contains all edges incident to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_{k+1}^G$$\end{document}. 4. Conclusion By induction, every forcing step \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u_i \rightarrow v_i$$\end{document} in G induces a corresponding propagation step in L(G) that monitors all edges incident to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_i$$\end{document}. Since \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_n^G = V(G)$$\end{document}, all edges of G become monitored in L(G), so \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} is a power dominating set of L(G). Remark: Propagation order may differ between G and L(G) due to parallel clique filling, but the existence of valid propagation sequences is preserved by the local uniqueness condition at each forcing edge. □ Example 3 We illustrate the power domination sequence on the Petersen graph and its simulation in the line graph. PMUs are placed at 1 and 9, so the domination step monitors their neighbours \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,5,6\}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{4,7,6\}$$\end{document}, giving the initial monitored set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{1,2,4,5,6,7,9\}$$\end{document} and leaving \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{3,8,10\}$$\end{document} unmonitored. A valid propagation sequence is 5→ 10, 10→ 8, and 2→ 3, after which all vertices of G are monitored. In the line graph L(G), the initial monitored set consists of all edges incident to 1 and 9, namely \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{(1,2),(1,5),(1,6),(9,4),(9,7),(9,6)\}$$\end{document}, which fully observe the cliques \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_9$$\end{document} during the domination step. To simulate the propagation step 10→ 8, we examine the clique \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_8=\{(3,8),(6,8),(8,10)\}$$\end{document} just before 8 becomes monitored in G. At this moment (6, 8)) is monitored, while (3, 8) and (8, 10) remain unmonitored, leaving \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_8$$\end{document} unmonitored: the monitored vertex (6, 8) has two unmonitored neighbors within the clique and therefore (6, 8) cannot propagate to other vertices of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_8$$\end{document}. Because there exists a valid power domination sequence in G, monitoring arrives from outside \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_8$$\end{document}. The vertex (3, 8) is shared with the already monitored clique \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_3$$\end{document}, and this eventually forces (3, 8) to become monitored. With only (8, 10) still unmonitored, the vertex (6, 8) now has exactly one unmonitored neighbour inside \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_8$$\end{document}, completing the monitoring of the clique through propagation. This is illustrated in Fig. 3. Fig. 3Illustration of the power-domination sequence on the Petersen graph and its simulation in the line graph. Red vertices indicate PMU locations, green vertices are vertices monitored in the domination step, aqua-blue vertices are monitored in the first propagation step, and light-blue vertices are monitored in the second propagation step. Single arrows indicate propagation from a monitored vertex to a newly monitored vertex in the first step, while double-lined arrows indicate propagation occurring in the second step. Illustration of the power-domination sequence on the Petersen graph and its simulation in the line graph. Red vertices indicate PMU locations, green vertices are vertices monitored in the domination step, aqua-blue vertices are monitored in the first propagation step, and light-blue vertices are monitored in the second propagation step. Single arrows indicate propagation from a monitored vertex to a newly monitored vertex in the first step, while double-lined arrows indicate propagation occurring in the second step. Theorem 2.2 Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G=\{v_1,\dots ,v_m\}$$\end{document} be a k-FPDS of G with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d(v_1)\le \cdots \le d(v_m)$$\end{document}. Then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}=\bigcup _{v\in S_G} V(K_v)$$\end{document} is a Q-FPDS of L(G), where\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k \le Q \le \left( \sum _{i=1}^{k+1} d(v_i)\right) -1,$$\end{document}. And Q attains its upper bound when \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is an independent k-fault tolerant power dominating set of G. Proof By Theorem 2.1, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} is a power dominating set of L(G). Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F \subseteq S_{L(G)}$$\end{document} be any fault set. We analyse how faults in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} affect the monitoring process in L(G) through their interaction with the cliques \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{K_v: v \in S_G\}$$\end{document}. Each clique \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_v$$\end{document} corresponds to the set of edges incident to v in G. A fault set F removes vertices from these cliques, and hence may partially or fully disable the contribution of certain vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. Let\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G'=\{\, v\in S_G : V(K_v)\nsubseteq F \,\}.$$\end{document}Then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G'$$\end{document} consists of those vertices whose corresponding cliques are not entirely eliminated by F. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|S_G \setminus S_G'| \le k$$\end{document}, then by the k-fault tolerance of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, the set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G'$$\end{document} remains a power dominating set of G. Hence, by Theorem 2.1,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\bigcup _{v\in S_G'} V(K_v)$$\end{document}is a power dominating set of L(G), and therefore \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} \setminus F$$\end{document} power dominates L(G). Thus, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} is Q-fault tolerant for some Q \ge k. To determine an upper bound on Q, observe that faults are most effective when they eliminate entire cliques. In the absence of overlap between cliques, removing all vertices from the (k+1) smallest cliques requires\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{i=1}^{k+1} d(v_i)$$\end{document}faults. Hence,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Q \le \left( \sum _{i=1}^{k+1} d(v_i)\right) -1.$$\end{document}When \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is independent, the cliques \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{K_v: v \in S_G\}$$\end{document} are pairwise disjoint, and this worst-case configuration is achievable. Therefore, in this case, the upper bound is attained. In contrast, when clique overlaps are present, interactions between overlapping structures may limit propagation in certain stages, preventing the achieved fault tolerance from reaching this upper bound. □ Example 4 Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} be an independent 1-FPDS whose vertex degrees are \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{ 3,4,8,10 \}$$\end{document}. We require at least 3+4=7 faults to render two cliques unmonitored. Thus \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} tolerates up to 6 faults and Q=7-1=6. Example 5 Consider the path graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G = P_n$$\end{document} with n \ge 5 and let k = 1. Define\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G=\{v_2,v_4\},$$\end{document}which is an independent 1-fault tolerant power dominating set of G. (It is straightforward to verify that removing any single vertex from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} still leaves a power dominating set of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_n$$\end{document}.) Each vertex in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} has \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\deg (v_i) = 2$$\end{document}, so Q = (2+2)-1 = 3. By the theorem 2.2,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}=\bigcup _{v\in S_G}V(K_v)=\{e_1,e_2,e_3,e_4\}$$\end{document}is a 3-FPDS of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L(P_n)=P_{n-1}$$\end{document}; and this is true. Note: Cycles \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_n$$\end{document} (n \ge 6) behave identically: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G=\{v_1,v_4\}$$\end{document} gives Q=3 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}=\{e_1,e_2,e_3,e_4\}$$\end{document} is 3-FPDS of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L(C_n)=C_n$$\end{document}. Example 6 Consider the star graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=K_{1,4}$$\end{document} with center c and leaves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l_1,l_2,l_3,l_4$$\end{document}, and let k=1. An independent 1-fault tolerant power dominating set of G is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G=\{l_1,l_2,l_3\}$$\end{document}. Indeed, each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l_i$$\end{document} monitors \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{l_i,c\}$$\end{document} in the domination step, after which c forces the remaining leaf. If any one leaf is removed from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, the remaining two leaves still observe c, which again forces the last unobserved leaf. Each vertex in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} has degree 1, so the two smallest degrees are 1 and 1, yieldingQ=(1+1)-1=1.By Theorem 2.2,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}=\bigcup _{v\in S_G}V(K_v)=\{e_1,e_2,e_3\},$$\end{document}where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e_i=(c,l_i)$$\end{document}, is a 1-fault tolerant power dominating set of the line graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L(G)=K_4$$\end{document}, though it is not the smallest 1-FPDS of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_4$$\end{document}. Remark While the induced monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} may exceed the theoretical minimum \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^k(L(G))$$\end{document}, its cardinality is explicitly derived from the known topology of G. In practice, minimising sensor count is often secondary to maximising the certifiability of the monitoring process. Our construction trades off absolute minimality for a guaranteed, topology-driven resilience bound that can be verified in linear time. In the absence of independence The upper bound mentioned in Theorem 2.2 is reached when the monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is independent. When the set is not independent, the induced cliques in L(G) will have overlaps that interfere with the propagation process. If two vertices of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} are adjacent in G, the corresponding cliques in L(G) intersect at the vertex representing their common edge. In such cases, a fault affecting this shared vertex simultaneously impacts multiple cliques. While this does not necessarily prevent propagation altogether, it can restrict certain forcing steps, thereby reducing the effective fault tolerance achieved in L(G). This structural dependence also alters the size of the induced monitoring set. Instead of a simple sum of degrees, we have\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|S_{L(G)}|=\sum _{v\in S_G} d(v)-|E(\langle S_G\rangle )|,$$\end{document}where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(\langle S_G\rangle )$$\end{document} denotes the edge set of the subgraph of G induced by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. Consequently, both the available redundancy and the achieved level of fault tolerance depend on the internal structure of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. These effects are illustrated in the following sections using the IEEE test bus systems. Algorithmic framework To support the case studies below, we present a simple procedural framework for both constructing a candidate PMU set and verifying its fault tolerance. The first routine selects an independent set using a degree-based greedy strategy, while the second checks whether the resulting configuration satisfies the k-fault tolerant power domination property. Together, these routines provide a reproducible implementation path for the theoretical results developed in the previous section. The placement of PMUs can also be achieved through various established approaches in the literature, including classical observability formulations, graph theoretic power domination models, and fault tolerant extensions for resilient monitoring9,10. Algorithm 1Greedy Construction of an Independent PMU Set Let n and m be, respectively, the number of vertices and edges in a graph G. First, we sort all the vertices of G in non-increasing order of their degrees, and we know that it requires O(nlogn) time. The algorithm then iteratively examines each vertex and checks whether it is adjacent to any vertex already included in the independent set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. In the worst case, this adjacency verification may require comparing a vertex with all previously selected vertices. Therefore, the overall time complexity of the algorithm is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n^2)$$\end{document}, when an adjacency matrix representation is used. If the graph is represented using adjacency lists, the worst-case complexity can increase to O(nm). Greedy Construction of an Independent PMU Set Before presenting the case studies, we also describe the procedure used to verify the fault tolerance of the induced monitoring set in the line graph. This methodology provides a concise and reproducible alternative to exhaustive step-by-step propagation tables, which become cumbersome for larger benchmark systems. Given a PMU configuration \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G \subseteq V(G)$$\end{document} and a fault tolerance parameter k, we evaluate the observability of the network under all fault sets of cardinality k. Since k-fault tolerance requires preservation of observability for every fault set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F \subseteq S_G$$\end{document} with |F| łe k, it is sufficient to test only the maximal-size fault sets. Algorithm 2Verification of k-Fault Tolerance Verification of k-Fault Tolerance In the line graph L(G), the same procedure is applied to the induced monitoring set\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} = \bigcup _{v \in S_G} V(K_v),$$\end{document}to verify whether the induced set remains fault tolerant under the power domination rules. Let p be the number of vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}. The algorithm verifies whether the PMU set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} remains power dominating after the failure of any k PMUs. First, it generates all possible subsets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F \subseteq S_G$$\end{document} such that |F| = k. The number of such subsets is\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( {\begin{array}{c}p\\ k\end{array}}\right) .$$\end{document}For each subset F, the algorithm performs the propagation process. Computing the initial monitored set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M = N[S_{\text {active}}]$$\end{document} requires at most O(n+m) time. During the while-loop, each iteration searches for a vertex satisfying the propagation rule, which in the worst case may examine all vertices and edges. Since at most n vertices can be added to the monitored set, the propagation phase requires at most O(n(n+m)) time. Therefore, the overall worst-case time complexity of the algorithm is\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boxed {O\!\left( \left( {\begin{array}{c}p\\ k\end{array}}\right) \, n(n+m)\right) }.$$\end{document}For sparse graphs where m = O(n), this simplifies to\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boxed {O\!\left( \left( {\begin{array}{c}p\\ k\end{array}}\right) \, n^2\right) }.$$\end{document} Case studies IEEE 14-bus system We illustrate how the presence of clique overlaps, arising from a non-independent monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, can prevent the fault tolerance amplification from reaching its upper bound, using the IEEE 14-bus system. In particular we show that the degree-based upper bound on fault tolerance is not attained when the monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is not independent. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G=\{2,4,6,13\}$$\end{document}, which is a 1-FPDS of G with vertex degrees d(2)=4, d(4)=5, d(6)=4, and d(13)=3. The degree-based expression predicts an upper bound of\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Q^*=(3+4)-1=6.$$\end{document}However, since \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is not independent, the corresponding cliques in L(G) overlap. As a result, this level of fault tolerance is not achieved. Consider the fault set\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F=\{(2,4),(4,7),(4,9),(4,3),(4,5)\},$$\end{document}with |F|=5<6. Due to the overlap between cliques, these faults affect multiple structures simultaneously (as illustrated in Fig. 4), and the resulting set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}\setminus F$$\end{document} fails to propagate monitoring to the entire graph. Hence, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} cannot tolerate up to 6 faults. In contrast, consider the independent set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G=\{3,5,9,12\}$$\end{document}. Each of these vertices has degree 2, and hence the degree-based bound givesQ=(2+2)-1=3.Since the cliques corresponding to these vertices are disjoint, the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} attains this bound and is a 3-fault tolerant power dominating set of L(G). This comparison highlights that clique overlaps do not necessarily prevent monitoring, but they can limit the achievable fault tolerance, preventing it from reaching the degree-based upper bound.Fig. 4Illustration of the monitoring process in Line graph of IEEE 14 - bus system - Vertices with colored outlines represent \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} \setminus F$$\end{document}, fully colored vertices are monitored, and unfilled vertices remain unmonitored. The example shows how overlapping cliques prevent the induced set from achieving the degree?based upper bound on fault tolerance. Illustration of the monitoring process in Line graph of IEEE 14 - bus system - Vertices with colored outlines represent \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)} \setminus F$$\end{document}, fully colored vertices are monitored, and unfilled vertices remain unmonitored. The example shows how overlapping cliques prevent the induced set from achieving the degree?based upper bound on fault tolerance. Implication: This example demonstrates that when the vertices of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} are adjacent, the fault tolerance of the induced monitoring set in L(G) cannot be determined solely by degree considerations. In particular, the overlap of cliques in L(G) creates configurations in which a small number of failures prevent the unique neighbour condition from ever being satisfied, even though many PMUs remain operational elsewhere in the network. IEEE 30-bus system To examine the fault tolerance behaviour in more complex network topologies, we analyse the IEEE 30-bus system with the 1-FPDS \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G = \{2, 6, 10, 12, 24, 27, 30\}$$\end{document}. The vertex degrees in G for this set are d(2)=3, d(6)=4, d(10)=3, d(12)=3, d(24)=2, d(27)=2, and d(30)=2. Using the two smallest degrees, d(24)=2 and d(27)=2, the degree-based upper bound predicted by the Fault-Tolerance Amplification Theorem is:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} Q^* = (2+2) - 1 = 3. \end{aligned}$$\end{document}However, because \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is not an independent set, the cliques in L(G) exhibit significant overlaps. Consequently, the actual fault tolerance Q of the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} is constrained by these structural dependencies. While the system remains 1-fault tolerant (i.e., Q \ge 1), the overlaps prevent the induced monitoring set from achieving the theoretical maximum of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Q^*=3$$\end{document}. IEEE 33-bus system We validate the Fault-Tolerance Amplification Theorem on the IEEE 33-bus radial distribution network. Unlike the highly meshed 14-bus system, the radial topology of the 33-bus network simplifies the identification of independent monitoring sets. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G = \{3, 6, 8, 19, 21\}$$\end{document} be an independent 1-FPDS. Then, the cliques \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{K_v: v \in S_G\}$$\end{document} in L(G) are strictly disjoint. With vertex degrees d(3)=3, d(6)=3, d(8)=2, d(19)=2, d(21)=2,; the smallest two degrees are d(19)=2 and d(8)=2. The theoretical upper bound is:Q = (2+2)-1 = 3.Exhaustive simulation of fault sets up to size 3 shows that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} maintains full observability. This confirms that in radial topologies, where independence is structurally inherent, the amplification formula provides a tight and reliable bound for resilient PMU placement. Fig. 5 shows the set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in G along with the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} in the corresponding line graph L(G)11. IEEE 69-bus system We also illustrate the previous theorem on the IEEE 69-bus system(see Fig. 6). The 69-bus system is deeper and more branched than the 33-bus case. Yet, its radial structure again makes finding independent sets straightforward. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G = \{3, 12, 14, 35, 37, 43, 68 \}$$\end{document} be an independent 1-FPDS. Using the degrees of these nodes:\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} Q=(2+2)-1=3. \end{aligned}$$\end{document}Heuristic methods show that the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} is a 3-fault tolerant power dominating set for L(G). This result strongly supports the strength of our framework. Figure 6 shows the set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in G and the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} in the line graph L(G)12.Fig. 5Set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in G along with the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} in the corresponding line graph L(G). Red vertices indicate the PMU locations in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, and the highlighted red vertices in the line graph represent the induced monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document}.Fig. 6Set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in G along with the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} in the corresponding line graph L(G). Red vertices indicate the PMU locations in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, and the highlighted red vertices in the line graph represent the induced monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document}.. Set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in G along with the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} in the corresponding line graph L(G). Red vertices indicate the PMU locations in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, and the highlighted red vertices in the line graph represent the induced monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document}. Set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} in G along with the induced set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document} in the corresponding line graph L(G). Red vertices indicate the PMU locations in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, and the highlighted red vertices in the line graph represent the induced monitoring set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{L(G)}$$\end{document}.. Comparison of power domination, fault tolerance, and line-graph amplification Classical PMU placement formulations seek a minimum number of PMUs that guarantee full network observability, typically via integer programming or heuristic optimisation directly on the bus network9,10. Fault tolerant variants introduce redundancy so that observability is preserved after the loss of a bounded number of PMUs, again optimising over sensor locations but remaining within a purely vertex?based setting4–6. By contrast, the present work does not propose yet another optimisation model; instead, it takes a given k-fault tolerant configuration on G and provides structural bounds on the fault tolerance of the induced edge?based configuration on L(G). This yields a simple, topology?aware certification tool that can be applied on top of any existing PMU placement solution, independent of how that solution was obtained. In this section, we summarise the values of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)$$\end{document} for several benchmark graphs, and we also record the corresponding Q-value obtained from the selected \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1$$\end{document}-set in the line graph. The examples are organised into two groups: elementary graphs such as paths, cycles, and stars, and IEEE bus systems. Table 3 lists the values for the illustrative graphs, while Table 4 presents the corresponding values for the IEEE benchmark systems.Table 3Illustrative examples showing the relationship between power domination, fault tolerance, and line graph amplification.GraphMinimum PDS of GMinimum 1-FPDS of GAmplified fault-tolerance Q in L(G)Path \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_n$$\end{document}, n \ge 5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(P_n)=1$$\end{document}; any internal vertex is a minimum PDS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(P_n)=2$$\end{document}; two non-adjacent degree-2 verticesQ=3Cycle \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_n$$\end{document}, n \ge 4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(C_n)=1$$\end{document}; any vertex is a minimum PDS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(C_n)=2$$\end{document}; two non-adjacent verticesQ=3Star \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_{1,4}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(K_{1,4})=1$$\end{document}; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{c\}$$\end{document}, where c is the center\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(K_{1,4})=3$$\end{document}; for example, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{c,l_2,l_3\}$$\end{document}Q=1Table 4The relationship between power domination, fault tolerance, and line graph amplification for IEEE benchmark systems.IEEE BusMinimum PDS of GMinimum 1-FPDS of GAmplified fault-tolerance Q in L(G)IEEE-9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=2$$\end{document}; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,6\}$$\end{document} or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,7\}$$\end{document} depending on the chosen model\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=3$$\end{document}; e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,6,7\}$$\end{document}Q=2IEEE-14\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=3$$\end{document}; e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,6,9\}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=4$$\end{document}; e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,5,6,7,9\}$$\end{document}Q=3IEEE-30\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=6$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=7$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1 \le Q \le 4$$\end{document}IEEE-33\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=3$$\end{document}; {2, 3, 6}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=5$$\end{document}Q=3IEEE-57\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G) = 5$$\end{document}; {4, 13, 29, 38, 56}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G) = 8$$\end{document}; {3, 4, 10, 13, 29, 31, 38, 56}Q = 4IEEE-69\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=4$$\end{document}; {3, 8, 9, 12}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=6$$\end{document}Q=3IEEE-118\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$32 \le \gamma _P \le 40$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$40 < \gamma _P^1(G) \le 54$$\end{document}IEEE-300\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$134 \le \gamma _P(G) \le 168$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$168 < \gamma _P^1(G) \le 182$$\end{document} Table 3Illustrative examples showing the relationship between power domination, fault tolerance, and line graph amplification.GraphMinimum PDS of GMinimum 1-FPDS of GAmplified fault-tolerance Q in L(G)Path \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_n$$\end{document}, n \ge 5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(P_n)=1$$\end{document}; any internal vertex is a minimum PDS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(P_n)=2$$\end{document}; two non-adjacent degree-2 verticesQ=3Cycle \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_n$$\end{document}, n \ge 4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(C_n)=1$$\end{document}; any vertex is a minimum PDS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(C_n)=2$$\end{document}; two non-adjacent verticesQ=3Star \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_{1,4}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(K_{1,4})=1$$\end{document}; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{c\}$$\end{document}, where c is the center\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(K_{1,4})=3$$\end{document}; for example, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{c,l_2,l_3\}$$\end{document}Q=1 Illustrative examples showing the relationship between power domination, fault tolerance, and line graph amplification. Table 4The relationship between power domination, fault tolerance, and line graph amplification for IEEE benchmark systems.IEEE BusMinimum PDS of GMinimum 1-FPDS of GAmplified fault-tolerance Q in L(G)IEEE-9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=2$$\end{document}; \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,6\}$$\end{document} or \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,7\}$$\end{document} depending on the chosen model\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=3$$\end{document}; e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,6,7\}$$\end{document}Q=2IEEE-14\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=3$$\end{document}; e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,6,9\}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=4$$\end{document}; e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{2,5,6,7,9\}$$\end{document}Q=3IEEE-30\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=6$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=7$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1 \le Q \le 4$$\end{document}IEEE-33\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=3$$\end{document}; {2, 3, 6}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=5$$\end{document}Q=3IEEE-57\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G) = 5$$\end{document}; {4, 13, 29, 38, 56}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G) = 8$$\end{document}; {3, 4, 10, 13, 29, 31, 38, 56}Q = 4IEEE-69\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P(G)=4$$\end{document}; {3, 8, 9, 12}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1(G)=6$$\end{document}Q=3IEEE-118\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$32 \le \gamma _P \le 40$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$40 < \gamma _P^1(G) \le 54$$\end{document}IEEE-300\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$134 \le \gamma _P(G) \le 168$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$168 < \gamma _P^1(G) \le 182$$\end{document} The relationship between power domination, fault tolerance, and line graph amplification for IEEE benchmark systems. The comparisons in Tables 3 and 4 show that fault tolerance increases the PMU requirement relative to the minimum power dominating set, while the line graph construction provides a structured way to quantify this increase from a chosen \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _P^1$$\end{document}-set. The illustrative graphs and IEEE test systems together indicate that the proposed framework is consistent across both small examples and standard benchmark networks. In particular, the method yields a clear and scalable way to relate the original monitoring configuration to its amplified fault-tolerant counterpart, thereby supporting its applicability to larger test cases without requiring a separate optimization model for each instance. In this context, the present work provides a theoretically grounded framework for fault tolerance amplification. Rather than relying on direct large-scale optimisation, the results offer a systematic way to construct fault tolerant monitoring sets from existing solutions. This underscores the practical relevance of the proposed approach, particularly for large networks where exhaustive computation may be difficult. These observations provide a qualitative comparison between existing PMU placement approaches and the proposed amplification framework, highlighting that our method complements, rather than replaces, optimisation?based designs. Conclusion This work analysed how the fault tolerance of resilient PMU placements changes under the line graph transformation. The Fault Tolerance Amplification Theorem shows that any k-fault tolerant power dominating set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} induces a Q-fault tolerant monitoring set in L(G), with Q bounded in terms of the degrees of the vertices in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document}, and that this bound is tight when \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_G$$\end{document} is independent. The case studies on paths, cycles, stars, and multiple IEEE test systems demonstrate that this amplification behaviour is robust across both small illustrative graphs and realistic power?network benchmarks. The approach has several deliberate limitations. It does not attempt to minimse the number of PMUs in L(G); instead, it assumes an existing k-FPDS on G and focuses on characterising the resulting fault tolerance after the line graph transformation. Most detailed case studies assume k=1, and the analysis is restricted to static, undirected network topologies. From a practical standpoint, the framework is attractive precisely because of its simplicity: given any candidate PMU configuration on G, engineers can quickly estimate the guaranteed fault tolerance in L(G) using only vertex degrees and basic topological information, without solving a new optimisation problem on the line graph. Future work can proceed in several directions. One natural extension is to integrate the amplification bounds into optimisation based PMU placement, for example by searching directly for independent k-FPDSs that maximise the induced tolerance Q. Another direction is to generalise the framework to weighted or directed graphs, and to dynamic settings where the network topology changes over time. Finally, a systematic comparison between the induced configurations in L(G) and minimum cardinality PMU placements obtained from existing methods would clarify how much redundancy is required in practice to maintain the same level of fault tolerance.