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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: Journal of Computational Methods in Sciences and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.