A Computer Search for the L-Borderenergetic Graphs

作者：Tao, Qingyun; Hou, Yaoping^*

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2017, 77(3): 595-606.

• LAPLACIAN ENERGY
• UPPER-BOUNDS
• ORDER 10

The Laplacian energy of a simple connected graph G is defined as LE(G) = Sigma(n)(i=1) vertical bar lambda(i) - (d) over bar vertical bar where lambda(i) are the Laplacian eigenvalues of G and (d) over bar is the average degree of G. Recently, Tura proposed the concept of L-borderenergetic graphs, which means that LE(G) = LE(K-n). In this paper, we first consider the extremal number of edges of non-complete L-borderenergetic graph, then use a computer search to find out all the L-borderenergetic graphs on no more than 10 vertices. The number of such graphs is 185. This could provide experience for further study on the L-borderenergetic graphs on large number of vertices.

• 出版日期2017
• 单位湖南文理学院; 湖南师范大学