Bridged graphs, circuits and Fibonacci numbers

Marx Stampfli

Applied Mathematics and Computation, 2017, vol. 302, issue C, 68-79

Abstract: Series-parallel two-terminal graphs and corresponding unit resistor circuits are well explored. Here we expand the ideas to exclusive-bridged graphs and unit resistor circuits. We proof that both types of circuits have rational resistances whereof numerators and denominators of reduced fractions are smaller or equal to the Fibonacci number Fn+1. Series-parallel circuits satisfy another inequality. The sum of their numerator and denominator is smaller or equal to Fn+2. This is not true for exclusive-bridged circuits. The consequence is that combinations of these circuits or double-bridged circuits do not satisfy these inequalities. In a second part, counting series-parallel graphs and circuits is expanded to exclusive bridged graphs and circuits. This leads to new terms in two OEIS sequences.

Keywords: Two-terminal graphs; Resistor circuits; Bridged networks; Combinatoric counting (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316307640
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:302:y:2017:i:c:p:68-79

DOI: 10.1016/j.amc.2016.12.030

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().