Mincuts in generalized Fibonacci graphs of degree 3
M Korenblit, VE Levit - Journal of Computational Methods in …, 2011 - content.iospress.com
Journal of Computational Methods in Sciences and Engineering, 2011•content.iospress.com
… We investigate the structure of mincuts (st-cuts) in generalized Fibonacci graphs, and the
relationship between the number of mincuts and the number of vertices in these graphs. It is
clear that an n-vertex FG1 which is a path graph has n − 1 mincuts. In [13] we investigated
the structure of mincuts in an n-vertex FG2 and proved that the number of mincuts in this
graph is equal to …
relationship between the number of mincuts and the number of vertices in these graphs. It is
clear that an n-vertex FG1 which is a path graph has n − 1 mincuts. In [13] we investigated
the structure of mincuts in an n-vertex FG2 and proved that the number of mincuts in this
graph is equal to …
Abstract
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.
content.iospress.com
以上显示的是最相近的搜索结果。 查看全部搜索结果