Premium
On weak completeness and weak non‐degeneracy of networks
Author(s) -
Milić Mirko M.,
Novak Ladislav A.
Publication year - 1989
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490170404
Subject(s) - degeneracy (biology) , controllability , completeness (order theory) , mathematics , nonlinear system , partition (number theory) , graph , topology (electrical circuits) , discrete mathematics , pure mathematics , mathematical analysis , combinatorics , physics , bioinformatics , quantum mechanics , biology
The graph‐theoretic properties depending on the element types and their controllability but not on the particular form of constitutive relations of elements are considered. New concepts such as normal partition pair of the branch set, weak completeness and weak non‐degeneracy are introduced and their properties are investigated in detail. These properties may then be used to formulate purely topological methods of analysing some dynamical aspects of nonlinear RLC networks.