Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Akbar Jahanbani"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 3, Pp 315-323 (2024)
Let G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the verte
Externí odkaz:
https://doaj.org/article/36d46ab61638478383ea1affc3c4097b
Publikováno v:
Discrete Mathematics Letters, Vol 5, Pp 41-48 (2021)
Externí odkaz:
https://doaj.org/article/3dc7c90a69c94377bea4de9e2398904a
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
Let F be the forgotten topological index of a graph G. The exponential of the forgotten topological index is defined as eFG=∑x,y∈Stx,yGex2+y2, where tx,yG is the number of edges joining vertices of degree x and y. Let Tn be the set of trees with
Externí odkaz:
https://doaj.org/article/c378ec75155543978649aa963f654edc
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
The topological index is a molecular predictor that is commonly supported in the research of QSAR of pharmaceuticals to numerically quantify their molecular features. Theoretical and statistical study of drug-like compounds improves the drug design a
Externí odkaz:
https://doaj.org/article/5d52890537bc4c3e8d0c41c400b94d10
Autor:
Akbar Jahanbani
Publikováno v:
Computer Science Journal of Moldova, Vol 27, Iss 2(80), Pp 188-203 (2019)
Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ a
Externí odkaz:
https://doaj.org/article/ea0ee8efd371470cb136fba306730d57
Publikováno v:
Journal of Chemistry, Vol 2021 (2021)
Irregularity indices are usually used for quantitative characterization of the topological structure of nonregular graphs. In numerous applications and problems in material engineering and chemistry, it is useful to be aware that how irregular a mole
Externí odkaz:
https://doaj.org/article/eafb27abe53c434db5763acb682df0f8
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
The ℱ-coindex (forgotten topological coindex) for a simple connected graph G is defined as the sum of the terms ζG2y+ζG2x over all nonadjacent vertex pairs x,y of G, where ζGy and ζGx are the degrees of the vertices y and x in G, respectively.
Externí odkaz:
https://doaj.org/article/c386c1c92861484d93916b004586b6d6
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
Let G be a graph with vertex set VG and edge set EG. Let du denote the degree of vertex u∈VG. The geometric-arithmetic index of G is defined as GAG=∑uv∈EG2dudv/du+dv. In this paper, we obtain some new lower and upper bounds for the geometric-ar
Externí odkaz:
https://doaj.org/article/0a4074a3e07544928de41cb4b2331f79
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
The Randić index of a graph G is defined as the sum of weights 1/dudv over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively. In this paper, we will obtain lower and upper bounds for the Randić index in t
Externí odkaz:
https://doaj.org/article/cd4195e164c949d09258ac9c7b8a0d86
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
Let G be a simple graph of order n and A be its adjacency matrix. Let λ1≥λ2≥…≥λn be eigenvalues of matrix A. Then, the energy of a graph G is defined as εG=∑i=1nλi. In this paper, we will discuss the new lower bounds for the energy of
Externí odkaz:
https://doaj.org/article/5d527cb4e3c54877b54b9b1a05589321