arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.02716math.CO
收藏

关于和-Balaban指数的最小值

On the minimum value of sum-Balaban index

Martin Knor, Jaka Kranjc, Riste Škrekovski, Aleksandra Tepeh

摘要:

研究了$n$顶点上图的和-Balaban指标的极值问题。我们确定当$n$趋于无穷大时,和-Balaban指数的最小值的上界至多为$4.47934$.对于小值的$n$,我们确定的极值图,我们观察到,他们是类似于哑铃图,在大多数情况下有一个额外的边缘添加到相应的极端通常Balaban指数。我们证明了在平衡哑铃图类中,团大小为$\sqrt[4]{\sqrt 2\log\big(1+\sqrt 2\big)}\sqrt n+o(\sqrt n)$的图具有渐近最小的和-Balaban指数。我们提出了一些关于这个主题的建议和问题。

英文摘要:

We consider extremal values of sum-Balaban index among graphs on $n$ vertices. We determine that the upper bound for the minimum value of the sum-Balaban index is at most $4.47934$ when $n$ goes to infinity. For small values of $n$ we determine the extremal graphs and we observe that they are similar to dumbbell graphs, in most cases having one extra edge added to the corresponding extreme for the usual Balaban index. We show that in the class of balanced dumbbell graphs, those with clique sizes $\sqrt[4]{\sqrt 2\log\big(1+\sqrt 2\big)}\sqrt n+o(\sqrt n)$ have asymptotically the smallest value of sum-Balaban index. We pose several conjectures and problems regarding this topic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑