ON THE DISTANCE-BASED TOPOLOGICAL INDICES OF FULLERENE AND FULLERENYL ANIONS HAVING DENDRIMER UNITS
Majid Arezoomand
Abstract
Majid Arezoomand
Abstract
A topological index is a real number related to a structural graph of a molecule. It does not depend on the labeling or pictorial representation of a graph. In recent years there has been considerable interest in the general problem of determining topological indices of nanotubes, nanotori and fullerenes. It has been established, for example, that the Wiener and hyper-Wiener indices of polyhex nanotubes and tori are computable from the molecular graph of these structures. Accordingly, some of the interest has been focused on computing topological indices of these nanostructures. Let G be an undirected connected graph without loops or multiple edges, with the vertex set V(G) and the edge set E(G). The distance between two vertices x and y is denoted by d(x,y). The Winer index W(G) of G, which is the oldest topological index, is a distance based topological index and is defined as the sum of distances between all vertices of the graph:
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A topological index is a real number related to a structural graph of a molecule. It does not depend on the labeling or pictorial representation of a graph. In recent years there has been considerable interest in the general problem of determining topological indices of nanotubes, nanotori and fullerenes. It has been established, for example, that the Wiener and hyper-Wiener indices of polyhex nanotubes and tori are computable from the molecular graph of these structures. Accordingly, some of the interest has been focused on computing topological indices of these nanostructures. Let G be an undirected connected graph without loops or multiple edges, with the vertex set V(G) and the edge set E(G). The distance between two vertices x and y is denoted by d(x,y). The Winer index W(G) of G, which is the oldest topological index, is a distance based topological index and is defined as the sum of distances between all vertices of the graph:
Key concepts: Topological index, Wiener index, Molecular graph, Combinatorics, Vertex (graph theory), Topology (electrical circuits), Mathematics, Topological graph