Temat: topological indices - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On the topological properties of the certain neural networks
Autorzy:: Liu, J.-B.
Zhao, J.
Wang, S.
Javaid, M.
Cao, J.
Powiązania:: https://bibliotekanauki.pl/articles/91804.pdf
Data publikacji:: 2018
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: neural network
topological indices
graph theory
Opis:: A topological index is a numeric quantity associated with a network or a graph that characterizes its whole structural properties. In [Javaid and Cao, Neural Computing and Applications, DOI 10.1007/s00521-017-2972-1], the various degree-based topological indices for the probabilistic neural networks are studied. We extend this study by considering the calculations of the other topological indices, and derive the analytical closed formulas for these new topological indices of the probabilistic neural network. Moreover, a comparative study using computer-based graphs has been carried out first time to clarify the nature of the computed topological descriptors for the probabilistic neural networks. Our results extend some known conclusions.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 257-268
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Schultz and Modified Schultz Polynomials of Coronene Polycyclic Aromatic Hydrocarbons
Autorzy:: Farahani, M. R.
Powiązania:: https://bibliotekanauki.pl/articles/412400.pdf
Data publikacji:: 2014
Wydawca:: Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:: topological Indices
Schultz Polynomial
Hosoya Polynomial
Wiener Index
coronene
polycyclic aromatic hydrocarbons
PAHs
Opis:: Let G = (V;E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V(G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices u and v in V(G) of graph G is the number of edges in a shortest path connecting them, we denote by d(u,v). In graph theory, we have many invariant polynomials for a graph G. In this research, we computing the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a Hydrocarbon molecule, that we call “Coronene Polycyclic Aromatic Hydrocarbons”.
Źródło:: International Letters of Chemistry, Physics and Astronomy; 2014, 13, 1; 1-10
2299-3843
Pojawia się w:: International Letters of Chemistry, Physics and Astronomy
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja