当前位置: X-MOL 学术Inf. Process. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Minimal 2-connected graphs satisfying the even cut condition
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-12-23 , DOI: 10.1016/j.ipl.2020.106080
Adam S. Jobson , André E. Kézdy , Jenő Lehel

If the bisection width of a 2-connected graph G of even order n is not less than n/2, i.e., if the graph satisfies the even cut condition, then G has at least 3n/22 edges. Here we characterize the 2-connected extremal graphs with 3n/22 edges for every n4. For n10 an extremal graph has two high-degree vertices, the other vertices have degree 2 and they are located on paths suspended between these poles.



中文翻译:

满足平切条件的最小2连通图

如果偶数阶n的2个连通图G的对分宽度不小于ñ/2即,如果图形满足均匀切割条件,则G至少具有3ñ/2-2边缘。这里我们用2表示极值图3ñ/2-2 每个边缘 ñ4。对于ñ10一个极值图具有两个高度顶点,其他顶点具有2度,并且它们位于这些之间的悬浮路径上。

更新日期:2021-01-05
down
wechat
bug