Mincuts in generalized Fibonacci graphs of degree 3

Mark Korenblit, Vadim E. Levit

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We investigate the structure of mincuts in an n-vertex generalized Fibonacci graph of degree 3 and show that the number CF 3(n) of mincuts in this graph is equal to CF 3(n-1) + CF 3(n-2) + CF 3(n-3) - CF 3(n-4) - CF 3(n-5) +1.

Original languageEnglish
Pages (from-to)271-280
Number of pages10
JournalJournal of Computational Methods in Sciences and Engineering
Issue number5-6
StatePublished - 2011


  • Fibnacci graph
  • directed acyclic graph
  • mincut
  • probabilistic graph


Dive into the research topics of 'Mincuts in generalized Fibonacci graphs of degree 3'. Together they form a unique fingerprint.

Cite this