IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v302y2017icp68-79.html
   My bibliography  Save this article

Bridged graphs, circuits and Fibonacci numbers

Author

Listed:
  • Stampfli, Marx

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.

Suggested Citation

  • Stampfli, Marx, 2017. "Bridged graphs, circuits and Fibonacci numbers," Applied Mathematics and Computation, Elsevier, vol. 302(C), pages 68-79.
    • Handle: RePEc:eee:apmaco:v:302:y:2017:i:c:p:68-79
    DOI: 10.1016/j.amc.2016.12.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316307640
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.12.030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:302:y:2017:i:c:p:68-79. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.