A series of counting, sequence and layer matrices are considered precursors of classifiers
capable of providing the partitions of the vertices of graphs. Classifiers are given to provide …

A detailed comparative investigation on the recently synthesised B 40 and C 40 along with
their metal nitride (Sc 3 N) and carbide (Sc 2 C 2) encapsulated endohedral fullerenes, is …

It is well-known that the small non-IPR fullerenes C n (n< 60) are highly unstable and that is
why they cannot be obtained as empty cages. However, they become stable as exohedral or …

In this work, we propose fullerene molecule C 20 as an anchor to fabricate a robust aromatic
molecular junction. The electron transport properties of this fullerene terminated aromatic …

Energy of a graph is defined as the sum of absolute values of the eigenvalues of its
adjacency matrix. Remote graphs are the graphs drawn on the remote adjacency matrices …

Tiling modification in nanostructure modeling can be achieved by map operations, as well
as the well-known Stone–Wales bond rotation. In this respect, sequences of classical …

XPS and NEXAFS spectra of four stable C40 isomers [29 (C 2), 31 (C s), 38 (D 2), and 39 (D
5 d)] have been investigated theoretically. We combined density functional theory and the …

Fullerenes are class of allotropes of carbon organized as closed cages or tubes of carbon
atoms. The fullerenes with small number of atoms were not frequently investigated. This …

A graph property P (G), written as a sequence of numbers counting its local partitions, can
be expressed as a counting polynomial P (G, x) with the exponents of the indeterminate x …

We calculate, compare, and discuss the charge transport properties through quasi fullerene
C40 obtained in three different electrode–C40–electrode testbeds by employing density …