Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Yaser Alizadeh"'
Publikováno v:
مدلسازی و مدیریت آب و خاک, Vol 4, Iss 1, Pp 233-247 (2024)
Introduction The limitation of water resources, increase in water demand for food supply, land use changes, climate change, and reduction of soil fertility are the most important challenges facing the world's food security. Various approaches have be
Externí odkaz:
https://doaj.org/article/64132dddbc6447b39ed9b22edcf07b80
Publikováno v:
پژوهشهای بذر ایران, Vol 5, Iss 2, Pp 59-71 (2019)
DOR: 98.1000/2383-1251.1397.5. 59.10.2.32.41 Extended abstract Introduction: Crop rotations are practiced to eliminate the effect of monoculture, but the succeeding crop may be influenced by the phytotoxins released by the preceding crop. Among plan
Externí odkaz:
https://doaj.org/article/d4f7c84f637a4adcb4f1fe528b88f908
Publikováno v:
International Journal of Molecular Sciences, Vol 9, Iss 2, Pp 131-144 (2008)
In this paper we give a GAP program for computing the Szeged and the PI indices of any graph. Also we compute the Szeged and PI indices of VC5C7[p,q] and HC5C7[p,q] nanotubes by this program.
Externí odkaz:
https://doaj.org/article/1b119a3ea1a0433a99c8f253bd32a1ef
Publikováno v:
Journal of Combinatorial Optimization. 41:817-829
The relation between the Wiener index W(G) and the eccentricity $$\varepsilon (G)$$ of a graph G is studied. Lower and upper bounds on W(G) in terms of $$\varepsilon (G)$$ are proved and extremal graphs characterized. A Nordhaus–Gaddum type result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8113c902f6ecc58bdf825f058e62014b
https://doi.org/10.1007/s10878-021-00724-2
https://doi.org/10.1007/s10878-021-00724-2
Publikováno v:
Filomat. 35:4637-4643
If G is a graph, and if for e = uv ? E(G) the number of vertices closer to u than to v is denoted by nu, then Mo(G) = ? uv?E(G) |nu-nv| is the Mostar index of G. In this paper, the Mostar index is studied on trees and graph products. Lower and upper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b79fc32b7be035ebcce133102f74fe4b
https://doi.org/10.2298/fil2114637a
https://doi.org/10.2298/fil2114637a
Autor:
Sandi Klavžar, Yaser Alizadeh
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:1123-1134
The eccentric connectivity index of a graph G is $$\xi ^c(G) = \sum _{v \in V(G)}\varepsilon (v)\deg (v)$$ , and the eccentric distance sum is $$\xi ^d(G) = \sum _{v \in V(G)}\varepsilon (v)D(v)$$ , where $$\varepsilon (v)$$ is the eccentricity of v,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f481d50463b16652f587722414f7d91
https://doi.org/10.1007/s40840-020-01015-5
https://doi.org/10.1007/s40840-020-01015-5
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 43:4443-4456
The irregularity of a graph G is the sum of $$|\mathrm{deg}(u) - \mathrm{deg}(v)|$$ over all edges uv of G. In this paper, this invariant is considered on $$\pi $$ -permutation graphs, Fibonacci cubes, and trees. An upper bound on the irregularity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10094234149419658c28eec67b1a284e
https://doi.org/10.1007/s40840-020-00932-9
https://doi.org/10.1007/s40840-020-00932-9
Publikováno v:
Discrete Applied Mathematics. 266:48-55
For a graph G , an infinite series of self-similar graphs is formed by the generalized Sierpinski graphs S G t , t ≥ 1 . In the case when G is complete we have the classical Sierpinski graphs S n t = S K n t . In this paper the Wiener index, the Wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf8976e0fc4f4f05b9fcc71a816011c6
https://doi.org/10.1016/j.dam.2018.07.008
https://doi.org/10.1016/j.dam.2018.07.008
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 10, Iss 2, Pp 218-240 (2018)
Let G be a simple connected graph. The reciprocal transmission Tr′G(ν) of a vertex ν is defined as Tr G ′ ( ν ) = ∑ u ∈ V ( G ) 1 d G ( u , ν ) , u ≠ ν . $${\rm{Tr}}_{\rm{G}}^\prime ({\rm{\nu }}) = \sum\limits_{{\rm{u}} \in {\rm{V}}(G)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::902fbdd1a649030cb02bc96784bd5252
https://doaj.org/article/489428efd40e403d8a24ad8fa3522061
https://doaj.org/article/489428efd40e403d8a24ad8fa3522061
