Connectedness in transfinite graphs and the existence and uniqueness of node voltages
In a transfinite graph two nodes may be connected by a transfinite path, that is by a sequential connection of possibly infinite many infinite paths. The author characterizes the totally ordered set of all embraced nodes along transfinite paths using an idea of nested sequences. It is shown by example that connectedness in transfinite graphs is not necessarily transitive as a binary relation between branches. A sufficient condition for transitivity of a class of connected graphs between branches is established. Electric networks with branches containing resistors and voltage sources whose graphs are transfinite are studied. A sufficient condition is established such that all node voltages are unique.
- Walk-based transfinite graphs and networks
- A maximum principle for node voltages in finitely structured, transfinite, electrical networks
- Random walks on finitely structured transfinite networks
- scientific article; zbMATH DE number 1091378 (Why is no real title available?)
- scientific article; zbMATH DE number 2116070 (Why is no real title available?)
- Uncountable transfinite graphs and electrical networks
- scientific article; zbMATH DE number 833370 (Why is no real title available?)
This page was built for publication: Connectedness in transfinite graphs and the existence and uniqueness of node voltages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896360)