The Szeged energy of fullerene graph
Presented by Mr. Gholamhossein FATHTABAR FIROUZJAEI
Type: Oral presentation
Track: Mathematical Chemistry
For a given graph G its Szeged weighting is deﬁned by w(e) =n_u(e)n_v(e), where e = uv is an edge of G, n_u(e) is the number of vertices of G closer to u than to v, and n_v(e) is deﬁned analogously. The adjacency matrix of a graph weighted in this way is called its Szeged matrix. Doslic et. al. defined Szeged energy of grph the summation of absolute value of eigenvalue of Szeged matrix. In this abstract we determine the Szeged energy for a family of fullerene graphs.