You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Mincuts in generalized Fibonacci graphs of degree 3

Article type: Research Article

Authors: Korenblit, Marka; * | Levit, Vadim E.b

Affiliations: [a] Holon Institute of Technology, Holon, Israel | [b] Ariel University Center of Samaria, Ariel, Israel

Correspondence: [*] Corresponding author. E-mail: [email protected].

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

Keywords: Fibonacci graph, mincut, directed acyclic graph, probabilistic graph

DOI: 10.3233/JCM-2011-0396

Journal: Journal of Computational Methods in Sciences and Engineering, vol. 11, no. 5-6, pp. 271-280, 2011

Published: 23 December 2011
Price: EUR 27.50
Show more