Bridged graphs, circuits and Fibonacci numbers

作者:

Highlights:

摘要

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.

论文关键词:Two-terminal graphs,Resistor circuits,Bridged networks,Combinatoric counting

论文评审过程:Received 9 March 2016, Revised 2 October 2016, Accepted 26 December 2016, Available online 21 January 2017, Version of Record 21 January 2017.

论文官网地址:https://doi.org/10.1016/j.amc.2016.12.030