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

Department of Mathematics

نتاج البحث: نشر في مجلة › مقالة › مراجعة النظراء

1 اقتباس (Scopus)

ملخص

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.

اللغة الأصلية	الإنجليزيّة
الصفحات (من إلى)	271-280
عدد الصفحات	10
دورية	Journal of Computational Methods in Sciences and Engineering
مستوى الصوت	11
رقم الإصدار	5-6
المعرِّفات الرقمية للأشياء	https://doi.org/10.3233/JCM-2011-0396
حالة النشر	نُشِر - 2011

الوصول إلى المستند

10.3233/JCM-2011-0396

الملفات والروابط الأخرى

Link to publication in Scopus

قم بذكر هذا

@article{bf0047b0cda441d7a658187f0d88a626,

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 = "SAGE Publications Ltd",

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 - https://www.scopus.com/pages/publications/84856422421

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

ملخص

الوصول إلى المستند

الملفات والروابط الأخرى

بصمة

قم بذكر هذا