Spectral Graph Theory and Network Dependability
Álvaro Torres, George J. Anders
Abstract
Álvaro Torres, George J. Anders
Abstract
The paper introduces methods of graph theory for ranking substations of an electric power grid. In particular, spectral graph theory is used and several ranking algorithms are described. The procedure is illustrated on a practical numerical example.
OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper introduces methods of graph theory for ranking substations of an electric power grid. In particular, spectral graph theory is used and several ranking algorithms are described. The procedure is illustrated on a practical numerical example.
Key concepts: Dependability, Graph theory, Computer science, Spectral graph theory, Graph, Theoretical computer science, Ranking (information retrieval), Algorithm