2009Unpublished venueRequires access

Spectral Graph Theory and Network Dependability

Álvaro Torres, George J. Anders

Open publisher page 22 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Dependability, Graph theory, Computer science, Spectral graph theory, Graph, Theoretical computer science, Ranking (information retrieval), Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Spectral Graph Theory and Network Dependability — Research Paper | ScholarLens