Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"PMU Covers"”.

  1. Characterizing Unmixed Trees and Coronas with Respect to PMU Covers

    … graphs. We use algebraic techniques to study the PMU Placement Problem from electrical engineering which asks for optimal placement of sensors, called PMUs, in an electrical power system. Motivated by algebraic and geometric considerations, we characterize the trees for which all minimal PMU …

    clemson Repository record for Characterizing Unmixed Trees and Coronas with Respect to PMU Covers (opens in a new tab)

  2. Characterizing Unmixed Trees with Respect to Total Domination and PMU Covers

    … between edge ideals and minimal vertex covers of a graph. Let $G=(V,E)$ be a simple graph with $V=\{x_1,\ldots,x_d\}$. The edge ideal of a graph is the ideal $I_G=(x_ix_j) \subsetneq k[x_1,\ldots,x_d]$ generated by the edges $x_ix_j \in E$. A vertex cover graph $G$ is a set of vertices …

    clemson Repository record for Characterizing Unmixed Trees with Respect to Total Domination and PMU Covers (opens in a new tab)

  3. Minimal PMU placement for graph observability: a decomposition approach

    This thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement …

    vt Repository record for Minimal PMU placement for graph observability: a decomposition approach (opens in a new tab)