Defects emerging in graphene from scattering of 10-100-eV carbon atoms

Yadgarov, I.D.; Stel’makh, V. G.; Rasulov, A. M.; Dzhurakhalov, A.A.

doi:10.1134/s1063784215030287

Cited by 6 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Для осуществления компьютерного моделирования использовалась программа Brenner's Code [10], которая реализует потенциал REBO [11], хорошо описывающий углеродные структуры. Эта программа, использованная нами в работе [12] для моделирования рассеяния атомов углерода на графене, а в [13] для моделирования взаимодействия круговых углеродных кластеров с нанографеном, также позволяет включить межатомное взаимодействие Леннарда-Джонса, которое необходимо для моделирования нековалентного взаимодействия углеродных структур.…”

Section: детали моделированияunclassified

Stable carbon structures: fullerene + Cn + graphene where Cn is a liner cluster

Stel’makh

Yadgarov

2019

Lett. Mater.

View full text Add to dashboard Cite

Structures formed by fullerene and graphene, interconnected by either a linear carbon cluster with the number of atoms from 2 to 5, or only by one carbon atom, have been studied by the methods of computational simulation. A simple covalent interaction of fullerene with graphene with no binding atoms and clusters has been considered and characteristics of noncovalent interaction of fullerene with graphene have been calculated. Stability of the fullerene-cluster-graphene structures is defined by covalent bonds of carbon atoms, which we set within the Brenner potential of the second generation (REBO), and by non-covalent interaction of fullerene with graphene, which is set by the Lennard-Jones interatomic potential. Fullerene in the structure of the fullerene-cluster-graphene is well fixed to a specific place owing to covalent bonds; this feature of the structures favorably differs from the case of the easily moving fullerene over the graphene surface, if it is necessary to rigidly fix fullerene on graphene. It is shown that good binding of fullerene with graphene is achieved by carbon clusters, and the best binding, if the cluster is diatomic, binding by one carbon atom also leads to a stable structure. A simple covalent bonding of fullerene with graphene is less stable. For the models of fullerene-cluster-graphene to be obtained, main computational simulation is performed step-by-step, starting with the models of free carbon linear clusters, defect-free fullerene and ideal graphene, and then simulation of fullerene binding with clusters is carried out; further binding of fullerene-cluster with graphene is simulated with taking into account non-covalent interaction of fullerene with graphene. The comparison of the calculated values of the binding energy has demonstrated which structures are more stable and how non-covalent interaction influences stability. By analyzing the obtained structures of fullerene-cluster-graphene, changes in the shape of fullerene and the distance of fullerene to graphene in these structures were determined.

show abstract

Section: детали моделированияunclassified

Stable carbon structures: fullerene + Cn + graphene where Cn is a liner cluster

Stel’makh

Yadgarov

2019

Lett. Mater.

View full text Add to dashboard Cite

show abstract

The effective role of temperature in improving the electrical conductivity and thermopower of n-PbTe films

Otajonov,

Khalilov,

Kochkorova

et al. 2024

E3S Web of Conf.

View full text Add to dashboard Cite

This paper discusses the effective role of temperature in improving the electrical conductivity and thermoelectric power of n-PbTe films obtained by high-temperature evaporation. It has been established that an increase in the substrate temperature to 350-370 0С leads to an increase in thermopower and electrical conductivity due to an increase in the diffusion process, leading to an increase in blocks. It is found that the thermoelectric parameters strongly depend on the film thickness.

show abstract

Algorithm of the electronic sign-code signature on the basis of the composition of existing complexities

Akbarov,

Umarov,

Turdimatov

et al. 2024

E3S Web of Conf.

View full text Add to dashboard Cite

The article developed a new algorithm for electronic digital signature in the composition of existing difficulties: discrete logarithm in a finite field, addition of points with rational coordinates of the elliptic curve. Based on a combination of the complexities of a discrete logarithm on a finite field with a large number characteristic, decomposition of a sufficiently large odd number into prime factors, and addition of points of an elliptic curve, an electronic digital signature algorithm is developed for generating. The generally recognized model of electronic sign-code signature covers three processes: generation of digital signature keys; ESS formation; confirmation of authenticity of electronic sign-code signature. Firmness offered AESS is based on several complexities: calculations of the discrete logarithming in a finite field, decisions of the task of expansion of enough big odd number on simple factors, executions of operation of addition of points of the elliptic curve set in a finite field. It considerably raises crypto algorithm strength.

show abstract

Defects emerging in graphene from scattering of 10-100-eV carbon atoms

Cited by 6 publications

References 4 publications

Stable carbon structures: fullerene + Cn + graphene where Cn is a liner cluster

Stable carbon structures: fullerene + Cn + graphene where Cn is a liner cluster

The effective role of temperature in improving the electrical conductivity and thermopower of n-PbTe films

Algorithm of the electronic sign-code signature on the basis of the composition of existing complexities

Contact Info

Product

Resources

About