An Application of Electrical Interaction Paths in Equivalence Networks to Identify Cut Edges and Vertices

Abstract

The removal of cut edges and cut vertices will lead to disconnected sub-graphs in a connected power network. These edges and vertices may stand for the weak places or some optimization partitioning and dimensionality reduction strategy, which have significance for such network analysis as power flow, voltage stability and relay coordination. The identification of cut edges and cut vertices can be expressed into observing the change of topology connectivity while removing some vertices or edges, which can be implemented by the geometrical topology analysis methods. Based on the analysis of equivalent networks and electrical interaction paths, this paper presents a novel physical topology analysis arithmetic to identify cut edges and vertices, which introduces two simple equality criterions derived from the reduced Z-matrix elements. The improvement over existing graph-theoretical approaches is in that this new arithmetic has specific physical significance, which can borrow ideas to insight and research the relationship between geometrical topology and physical topology in power network