Minimum resolving sets (edge or vertex) have become an integral part of molecular topology
and combinatorial chemistry. Resolving sets for a specific network provide crucial …

A fullerene is a cubic three-connected graph whose faces are entirely composed of
pentagons and hexagons. Entropy applied to graphs is one of the significant approaches to …

Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces,
while all other faces are hexagons. Fullerene graphs are mathematical models of fullerene …

The Wiener dimension of a connected graph is introduced as the number of different
distances of its vertices. For any integer D and any integer k, a graph of diameter D and of …

A compilation of ZZ polynomials (aka Zhang–Zhang polynomials or Clar covering
polynomials) for all isomers of small (5, 6)-fullerenes C n with n= 20–50 is presented. The ZZ …

The saturation number of a graph $ G $ is the cardinality of any smallest maximal matching
of $ G $, and it is denoted by $ s (G) $. Fullerene graphs are cubic planar graphs with exactly …

The topological partition theory states that icosahedral group affine extensions (fullerenes
symmetry) are the most effective way to energetically optimize the surface covering. In recent …

We report an extensive tabulation of several important topological invariants for all the
isomers of carbon (5, 6)-fullerenes Cn with n= 52–70. The topological invariants (including …

A fullerene graph is a cubic bridgeless plane graph with all faces of size 5 and 6. We show
that every fullerene graph on n vertices can be made bipartite by deleting at most 12n/5 …

The Timisoara-eccentricity (TM-EC) index of a molecular graph is defined as the sum of δiεiζi
over all atoms i in Γ, where ζi, εi and ζi are the degree, eccentricity and the number of atoms …