Connectedness in transfinite graphs and the existence and uniqueness of node voltages (Q1896360): Difference between revisions

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.