✦ LIBER ✦

Uncountable transfinite graphs and electrical networks

✍ Scribed by A. H. Zemanian

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 816 KB
Volume: 22
Category: Article
ISSN: 0098-9886
DOI: 10.1002/cta.4490220507

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Description of electrical networks using

Description of electrical networks using bond graphs

✍ Alan S. Perelson 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 989 KB

Hyperreal transients in transfinite RLC

Hyperreal transients in transfinite RLC networks

✍ A. H. Zemanian 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract Up to the present time, there have been no transient analyses of RLC transfinite networks. Standard analyses of transfinite networks have been restricted to purely resistive ones. In this paper, it is shown how non‐standard analysis can be used to examine the transient behaviour of tran

The existence and uniqueness of node vol

The existence and uniqueness of node voltages in a non-linear resistive transfinite electrical network

✍ Zemanian, A. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 650 KB

Transfinite resistive electrical networks have unique voltage-current regimes under very broad conditions on their resistances and source values; this has been established previously. However, as is shown by example in this paper, such networks need not have unique node voltages with respect to a ch

Graphs and networks

✍ J.V. Oldfield 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The concepts and application of graph theory to practical problems involving networks are discussed. Examples are given from digital system design.

The curl of graphs and networks

✍ Karl Gustafson; Frank Harary 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 775 KB

Balanced graphs and network flows

✍ Penrice, Stephen G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be com