Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Akbar Ali"'
Publikováno v:
Combinatorial Chemistry & High Throughput Screening. 25:476-482
Background:: A topological index of a molecular graph is the numeric quantity which can predict certain physical and chemical properties of the corresponding molecule. Xu et al. introduced some graph transformations which increase or decrease the fir
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2021 (2021)
A bond incident degree (BID) index of a graph G is defined as ∑ u v ∈ E G f d G u , d G v , where d G w denotes the degree of a vertex w of G , E G is the edge set of G , and f is a real-valued symmetric function. The choice f d G u , d G v = a d
Autor:
Akbar Ali, Shahid Zaman
Publikováno v:
Journal of Applied Mathematics and Computing. 67:131-142
The connective eccentricity index (CEI) of a connected graph G is defined as $$\xi ^{ee}(G)=\sum _{u\in V_G}[d_G(u)/\varepsilon _G(u)]$$ , where $$d_G(u)$$ and $$\varepsilon _G(u)$$ are the degree and eccentricity, respectively, of the vertex $$u\in
Publikováno v:
match Communications in Mathematical and in Computer Chemistry. 87:133-146
Publikováno v:
match Communications in Mathematical and in Computer Chemistry. 87:89-96
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2020 (2020)
The first general Zagreb (FGZ) index (also known as the general zeroth-order Randić index) of a graph G can be defined as M γ G = ∑ u v ∈ E G d G γ − 1 u + d G γ − 1 v , where γ is a real number. As M γ G is equal to the order and size
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 920-923 (2020)
The variable sum exdeg index, introduced by Vukičević [Croat. Chem. Acta 84 (2011) 87–91] for predicting the octanol-water partition coefficient of certain chemical compounds, of a graph G is defined as where a is any positive real number differe
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 1, Pp 59-70 (2020)
Let G = (V,E) be a simple connected graph with the vertex set V = {1,2,...,n} and sequence of vertex degrees (d1,d2,...,dn) where di denotes the degree of a vertex i ∈ V. With i ∼ j, we denote the adjacency of the vertices i and j in the graph G.
Publikováno v:
Afrika Matematika. 31:771-780
The harmonic index of a graph G is denoted by H(G) and is defined as $$H(G)=\sum _{uv\in E(G)} \frac{2}{d_{u}+d_{v}}$$ , where $$d_u$$ , $$d_v$$ denote the degrees of the vertices u, v, respectively, of G and E(G) is the edge set of G. In this paper,
Publikováno v:
Journal of Applied Mathematics and Computing. 62:179-187
Let G be a simple connected non-trivial graph of order n, size m, and vertex degree sequence ($$d_1, d_2,\ldots , d_n$$). The first Zagreb index $$M_1$$, forgotten index F and inverse degree ID are the graph invariants defined as $$M_1(G)=\sum _{i=1}