The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

Let G be a simple connected graph. Schultz and modified Schultz indices are defined as:
the degree of vertex u and d(u, ν) is the distance between u and ν. Let e be an edge of a graph G connecting the vertices u and ν. Define two sets

respectively. Szeged index of G is defined as:

In this paper we give a GAP program for computing the Schultz, the Modified Schultz and the Szeged indices of a simple connected graph. Also we compute and formulate these indices for a family of fullerenes by the software GAP and MAPLE.

Keywords: Schultz index, Modified Schultz index, Szeged index, C_{12 (n-1)} fullerenes.