I. Introduction
The buses and transmission lines of a power grid translate naturally to the nodes and edges of a graph. This connection has been recognized for many years, and numerous graph structural properties have been studied with various power systems applications [1], [2]. Graph-theoretical methods have been used to identify system vulnerabilities [3]–[5], detect structural anomalies [6], generate and validate synthetic grids [7]–[10], create meaningful visualizations [11], [12], and perform partitioning [13], [14]. The graph analysis methods employed may be divided into two categories: weighted, where electrical information is embedded in the graph, and unweighted, where only topology is considered. Though there is a fundamental difference between a power system's topology and its electrical structure [4], [8], [15], unweighted graph analysis is ideal for quickly detecting unusual connectivity patterns. The topological algorithms used in this paper are computationally inexpensive, and interpretation of numerical results is straightforward. Consequently, it is feasible to scan large power grids to check for structural anomalies.