The aim of this paper is to identify the topological entities underlying the construction of a complete (not reduced) network model. Consider an active network as a pair of physically different structures, i.e. a ‘dead network’ and an ‘excitation’. First, we define the general structure of the excitation which can be applied to a dead network; then the graphs Ga and G of the active and dead networks, respectively, are introduced. It is shown that, if a complete network model is to be constructed, the topological relations among the voltages and those among the currents of the network elements must be written choosing maximal independent sets of loops and cut‐sets of Ga. It is successively pointed out that the graph G can be obtained from Ga by means of a reduction operation, and the topological entities of G corresponding to the loops and to the cut‐sets of Ga are singled out. It has been found that a complete model of an electric network implies the use of four topological entities defined on the set of G‐edges, i.e. the closed path, the open path, the cut‐set and the pseudo‐cut, together with two topological entities defined on a maximal set of independent vertex couples of G, i.e. the ‘junction pair’ extreme of an open path and the ‘family of independent node couples’ split by a cut‐set. Furthermore the different reference frames and the relative topological matrix transformations which allow a complete model of the network to be built up are singled out and discussed.

The topological foundations of electrical networks — complete models

G. Acciani;G. Cafaro;F. Vacca
1987

Abstract

The aim of this paper is to identify the topological entities underlying the construction of a complete (not reduced) network model. Consider an active network as a pair of physically different structures, i.e. a ‘dead network’ and an ‘excitation’. First, we define the general structure of the excitation which can be applied to a dead network; then the graphs Ga and G of the active and dead networks, respectively, are introduced. It is shown that, if a complete network model is to be constructed, the topological relations among the voltages and those among the currents of the network elements must be written choosing maximal independent sets of loops and cut‐sets of Ga. It is successively pointed out that the graph G can be obtained from Ga by means of a reduction operation, and the topological entities of G corresponding to the loops and to the cut‐sets of Ga are singled out. It has been found that a complete model of an electric network implies the use of four topological entities defined on the set of G‐edges, i.e. the closed path, the open path, the cut‐set and the pseudo‐cut, together with two topological entities defined on a maximal set of independent vertex couples of G, i.e. the ‘junction pair’ extreme of an open path and the ‘family of independent node couples’ split by a cut‐set. Furthermore the different reference frames and the relative topological matrix transformations which allow a complete model of the network to be built up are singled out and discussed.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11589/2540
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact