Mincuts in generalized Fibonacci graphs of degree 3

Authors:
Mark Korenblit;Vadim E. Levit
Affiliations:
Holon Institute of Technology, Holon, Israel;Ariel University Center of Samaria, Ariel, Israel
Venue:
Journal of Computational Methods in Sciences and Engineering
Year:
2011

Citing 6
Cited 0

Disjoint products and efficient computation of reliability

Operations Research
Network reliability and algebraic structures

Network reliability and algebraic structures
Optimal reduction of two-terminal directed acyclic graphs

SIAM Journal on Computing
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

Journal of the ACM (JACM)
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
On the Number of Minimum Cuts in a Graph

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.