Zobrazeno 1 - 10
of 305
pro vyhledávání: '"Farahani Mohammad Reza"'
Publikováno v:
Open Physics, Vol 15, Iss 1, Pp 261-269 (2017)
It’s revealed from the earlier researches that many physical-chemical properties depend heavily on the structure of corresponding moleculars. This fact provides us an approach to measure the physical-chemical characteristics of substances and mater
Externí odkaz:
https://doaj.org/article/a8c4ca996dc8467ca7fcd0e13ae2c767
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 1, Iss 1, Pp 283-290 (2016)
Let G be a simple connected graph. The geometric-arithmetic index of G is defined as GA1(G)=∑uν∈E(G)2d(u)d(ν)d(u)+d(ν)$\begin{array}{} G{A_1}\left( G \right) = {\sum\nolimits _{u\nu \in E(G)}}\frac{{2\sqrt {d(u)d(\nu)} }}{{d(u) + d(\nu)}} \end
Externí odkaz:
https://doaj.org/article/db882217877e4d308c7e932a55649a25
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 1, Iss 1, Pp 247-252 (2016)
A Recently, Ghorbani et. al. introduced the eccentric versions of first and second Zagreb indices called third and fourth Zagreb indices defined asM3 (G) = Σuv∊E(G) (ε (u) + ε (ν)) and M4 (G) = Σν∊V(G)ε (ν)2, respectively, where ε (ν)is
Externí odkaz:
https://doaj.org/article/613b4ab5af134eec9a1382903039a3a9
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 1, Iss 1, Pp 175-182 (2016)
A topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The Padmakar-Ivan (PI) index of a graph G is defined as PI(G) = Σe=uv∈E(G) [nu + nv], where nu is the number of edges of G lying close
Externí odkaz:
https://doaj.org/article/fb8eadf522a5423eaba3ceca4e2040d9
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 1, Iss 1, Pp 159-174 (2016)
In this article, we propose an ontology learning algorithm for ontology similarity measure and ontology mapping in view of distance function learning techniques. Using the distance computation formulation, all the pairs of ontology vertices are mappe
Externí odkaz:
https://doaj.org/article/06561d262cf9412b982a979d4f9dda7b
Autor:
Gao Wei, Farahani Mohammad Reza
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 1, Iss 1, Pp 99-122 (2016)
In computational chemistry, the molecular structures are modelled as graphs which are called the molecular graphs. In these graphs, each vertex represents an atom and each edge denotes covalent bound between atoms. It is shown that the topological in
Externí odkaz:
https://doaj.org/article/33a7d2f38954416c958c5c94ead40b60
Autor:
Wang, Shaohui, Farahani, Mohammad Reza, Kanna, M. R. Rajesh, Jamil, Muhammad Kamran, Kumar, R. Pradeep
Let G be a simple connected graph having vertex set V and edge set E. The vertex-set and edge-set of G denoted by V(G) and E(G), respectively. The length of the smallest path between two vertices is called the distance. Mathematical chemistry is the
Externí odkaz:
http://arxiv.org/abs/1607.00402
Autor:
Farahani, Mohammad Reza1 (AUTHOR), Rezaei Ashtiani, Hamid Reza1 (AUTHOR) hr_rezaei@arakut.ac.ir, Elahi, S. H.1 (AUTHOR)
Publikováno v:
International Journal of Metalcasting. Apr2022, Vol. 16 Issue 2, p713-722. 10p.
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics April 2017 14(1):80-91
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.