当前位置:
X-MOL 学术
›
J. Appl. Math. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
A proof of a conjecture on maximum Wiener index of oriented ladder graphs
Journal of Applied Mathematics and Computing ( IF 2.4 ) Pub Date : 2021-01-13 , DOI: 10.1007/s12190-021-01498-w Tadeja Kraner Šumenjak , Simon Špacapan , Daša Štesl
中文翻译:
关于有向梯形图的最大维纳指数的猜想的证明
更新日期:2021-01-14
Journal of Applied Mathematics and Computing ( IF 2.4 ) Pub Date : 2021-01-13 , DOI: 10.1007/s12190-021-01498-w Tadeja Kraner Šumenjak , Simon Špacapan , Daša Štesl
The ladder graph \(L_n\) is the Cartesian product of a path on n vertices and a complete graph on two vertices. The Wiener index of a digraph is the sum of distances between all ordered pairs of vertices. In Knor et al. (Bounds in chemical graph theory - advances, 2017) the authors conjectured that the maximum Wiener index of a digraph whose underlying graph is \(L_n\) is \((8n^3+3n^2-5n+6)/3\). In this article we prove the conjecture.
中文翻译:
关于有向梯形图的最大维纳指数的猜想的证明
梯形图\(L_n \)是n个顶点上的路径和两个顶点上的完整图的笛卡尔积。有向图的维纳指数是所有有序顶点对之间的距离之和。在克诺(Knor)等人中。(化学图论的界限-进展,2017年)作者推测,基础图为\(L_n \)的有向图的最大Wiener指数为\((8n ^ 3 + 3n ^ 2-5n + 6)/ 3 \ )。在本文中,我们证明了这种猜想。