Mincuts in generalized Fibonacci graphs of degree 3

Mark Korenblit; Vadim E. Levit

doi:10.3233/jcm-2011-0396

Mincuts in generalized Fibonacci graphs of degree 3

Mark Korenblit, Vadim E. Levit

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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

Original language	English
Pages (from-to)	271-280
Number of pages	10
Journal	Journal of Computational Methods in Sciences and Engineering
Volume	11
Issue number	5-6
DOIs	https://doi.org/10.3233/jcm-2011-0396
State	Published - 2011
Externally published	Yes

Keywords

Fibnacci graph
directed acyclic graph
mincut
probabilistic graph

Access to Document

10.3233/jcm-2011-0396

Cite this

@article{4f47db53a0fc4fde9c45e30b4c876057,

title = "Mincuts in generalized Fibonacci graphs of degree 3",

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.",

keywords = "Fibnacci graph, directed acyclic graph, mincut, probabilistic graph",

author = "Mark Korenblit and Levit, {Vadim E.}",

year = "2011",

doi = "10.3233/jcm-2011-0396",

language = "אנגלית",

volume = "11",

pages = "271--280",

journal = "Journal of Computational Methods in Sciences and Engineering",

issn = "1472-7978",

publisher = "IOS Press BV",

number = "5-6",

}

TY - JOUR

T1 - Mincuts in generalized Fibonacci graphs of degree 3

AU - Korenblit, Mark

AU - Levit, Vadim E.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Fibnacci graph

KW - directed acyclic graph

KW - mincut

KW - probabilistic graph

UR - http://www.scopus.com/inward/record.url?scp=84856422421&partnerID=8YFLogxK

U2 - 10.3233/jcm-2011-0396

DO - 10.3233/jcm-2011-0396

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84856422421

SN - 1472-7978

VL - 11

SP - 271

EP - 280

JO - Journal of Computational Methods in Sciences and Engineering

JF - Journal of Computational Methods in Sciences and Engineering

IS - 5-6

ER -

Mincuts in generalized Fibonacci graphs of degree 3

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this