On comparison between the distance energies of a connected graph

对连通图的距离能量进行比较

阅读:1

Abstract

Let G be a simple connected graph of order n having Wiener index W(G) . The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined as DE(G) = ∑ i = 1n|υiD|,  DLE(G) = ∑ i = 1n|υiL - Tr‾| and DSLE(G) = ∑ i = 1n|υiQ - Tr‾|,  where υiD, υiL and υiQ, 1 ≤ i ≤ n are respectively the distance, distance Laplacian and the distance signless Laplacian eigenvalues of G and Tr‾ = 2/ is the average transmission degree. In this paper, we will study the relation between DE(G) , DLE(G) and DSLE(G) . We obtain some necessary conditions for the inequalities DLE(G) ≥ DSLE(G), DLE(G) ≤ DSLE(G), DLE(G) ≥ DE(G) and DSLE(G) ≥ DE(G) to hold. We will show for graphs with one positive distance eigenvalue the inequality DSLE(G) ≥ DE(G) always holds. Further, we will show for the complete bipartite graphs the inequality DLE(G) ≥ DSLE(G) ≥ DE(G) holds. We end this paper by computational results on graphs of order at most 6.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。