scispace - formally typeset
Search or ask a question

Showing papers on "Network topology published in 1973"


Journal ArticleDOI
TL;DR: It is proved mathematically that each point of an additive network gives a coefficient value of zero, whereas each point not belonging to an additivenetwork gives a coefficients value greater than zero, which suggests an iterative procedure in which “false” network points are replaced by “true” ones.

140 citations


Journal ArticleDOI
TL;DR: In this article, the effects of breaker operation on the power system topology are considered and provisions are made to automatically incorporate in real-time the effect of breaker operations on the topology of a power system.
Abstract: The determination of power system network topology for off-line studies is a relatively simple problem since one-line diagrams inherently describe system configuration. In real time environments, system configuration is dynamic. Breakers may operate at any time producing some of the following effects: 1) circuits may or may not be disconnected, 2) substations may or may not separate possibly forming new nodes, thus varying the total number of nodes in a system, and 3) an interconnected system may split into several separated areas. Unless provisions are made to automatically incorporate in real time the effects of breaker operations on system topology, any calculation and decision based on a wrong configuration would be dangerous, especially when most needed: immediately after the occurrence of the abnormality ity which lead to breaker operations.

88 citations


Journal ArticleDOI
TL;DR: In this paper, a maximal set, called a basis, of variables that are linearly independent with respect to coefficients that are rational functions in edge admittances is determined in linear resistive networks, and existence theorems on mappings from given variables to all the source currents and voltages are presented.
Abstract: In a linear resistive network, a maximal set, called a basis, of variables that are linearly independent with respect to coefficients that are rational functions in edge admittances is determined. It is shown that the basis is an important concept in linear network analysis in the sense that any network equation can uniquely and minimally be expressible in terms of the elements in a basis. In order to characterize the algebraic structure of the variables in connection with the basis, existence theorems on mappings from given variables to all the source currents and voltages are presented.

6 citations


Journal ArticleDOI
TL;DR: An efficient algorithm is introduced for assigning a terminal as a centre in a tree network that makes the network reliable under a given reliability index.
Abstract: An efficient algorithm is introduced for assigning a terminal as a centre in a tree network that makes the network reliable under a given reliability index. Some generalisation for multiple-centre assignment is provided.

5 citations


Journal ArticleDOI
TL;DR: In this paper, a general type of topological formulas for linear electrical networks, where the characteristics of branches are expressed in terms of impedances and admittances, were established.
Abstract: "Topological formulas" are established for the most general type of linear electrical networks in which the characteristics of branches are expressed in terms partly of impedances and partly of admittances. We shall call this type of topological formulas "mixedtype topological formulas." Moreover, the networks under consideration may contain any type of mutual coupling such as active elements, controlled sources, ideal transformers, etc. The formulas are derived directly from the fundamental laws in network theory. Existing topological formulas are particular cases of those presented in this paper, and our way of derivation will be one of the most straightforward and can be applied to derive any known topological formula. Use is made only of the topological properties of original networks but not of auxiliary graphs such as voltage graphs, current graphs, and (signal-) flow graphs. The denominators and numerators of the formulas are expressed as the sum of the immittance products corresponding to the tree-cotree pairs of special kinds, and the sign of each term in the sum is characterized in topological terms.

4 citations