# Search results for: Xueliang Li

Discrete Applied Mathematics > 2013 > 161 > 16-17 > 2527-2531

Linear Algebra and Its Applications > 2011 > 435 > 4 > 804-810

Discrete Applied Mathematics > 2013 > 161 > 16-17 > 2527-2531

The revised Szeged index of a graph G is defined as Sz∗(G)=∑e=uv∈E(nu(e)+n0(e)/2)(nv(e)+n0(e)/2), where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u, and n0(e) is the number of vertices equidistant to u and v. Hansen et al. used the AutoGraphiX and made the following...

Linear Algebra and Its Applications > 2011 > 435 > 4 > 804-810

The energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let Cn denote the cycle of order n and Pn6,6 the graph obtained from joining two cycles C6 by a path Pn-12 with its two leaves. Let Bn denote the class of all bipartite bicyclic graphs but not the graph Ra,b, which is obtained from joining two cycles Ca and Cb (a,b≥10...