Connectedness in transfinite graphs and the existence and uniqueness of node voltages
DOI10.1016/0012-365X(93)E0223-QzbMATH Open0829.05040OpenAlexW2016722882WikidataQ128011876 ScholiaQ128011876MaRDI QIDQ1896360FDOQ1896360
Authors: Armen H. Zemanian
Publication date: 1 January 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0223-q
Recommendations
networkstransitivitypathsconnectivityconnectednessconnectionvoltagecircuitsnodesconnected graphsbranchestransfinite graphsnode voltagestransfinite paths
Paths and cycles (05C38) Connectivity (05C40) Analytic circuit theory (94C05) Applications of graph theory to circuits and networks (94C15)
Cites Work
Cited In (6)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A maximum principle for node voltages in finitely structured, transfinite, electrical networks
- Uncountable transfinite graphs and electrical networks
- Random walks on finitely structured transfinite networks
- Walk-based transfinite graphs and networks
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)