Results 31 to 40 of about 71 (70)
Computing Some Topological Indices of Two Kinds of Dendrimer Graphs G[n] and H[n]
Journal of Mathematics, Volume 2024, Issue 1, 2024.Dendrimer molecules are macromolecules which have many applications in nanosciences, drug delivery, biology, and different areas of sciences. Topological indices of chemical graph theory are numerical descriptor of a molecular structure. The dendrimer graph G[n] is obtained by attaching the new paths P9, joined each pendant vertex of G[n − 1] to ...
Hojat Kaviani +2 more
wiley +1 more source
Main Group Metal ChemistryTopological indices play a central role in mathematical chemistry for correlating structural features of molecular graphs with physicochemical properties.
Noreen Tahira, Salman Muhammad
doaj +1 more source
Main Group Metal ChemistryFor a graph Q=(V,E){\mathbb{Q}}=\left({\mathbb{V}},{\mathbb{E}}), the transformation graph are defined as graphs with vertex set being V(Q)∪E(Q){\mathbb{V}}\left({\mathbb{Q}})\cup {\mathbb{E}}\left({\mathbb{Q}}) and edge set is described following ...
Ali Parvez +5 more
doaj +1 more source
Indeks Padmakar-Ivan dan indeks Randic pada graf non-koprima dari grup bilangan bulat modulo
Majalah Ilmiah Matematika dan StatistikaGraph theory, introduced by the Swiss mathematician Leonhard Euler in 1736, has played a pivotal role in solving real-world problems since its inception, notably exemplified by Euler's solution to the Konigsberg Bridge problem. Its applications extend to
Lalu Hasan Ghoffari +2 more
doaj +1 more source
The minimum exponential atom-bond connectivity energy of trees
Special MatricesLet G=(V(G),E(G))G=\left(V\left(G),E\left(G)) be a graph of order nn. The exponential atom-bond connectivity matrix AeABC(G){A}_{{e}^{{\rm{ABC}}}}\left(G) of GG is an n×nn\times n matrix whose (i,j)\left(i,j)-entry is equal to ed(vi)+d(vj)−2d(vi)d(vj){e}^
Gao Wei
doaj +1 more source
Mathematical and Computer Modelling of Dynamical SystemsVertex and edge operations are very popular tools in studying several properties of graphs, as they help us to calculate complex statements by means of easier or well-known ones. Deletion is probably the most important graph operation.
Hacer Ozden Ayna, Ismail Naci Cangul
doaj +1 more source
A new method for computing the vertex PI index with applications to special classes of graphs
AKCE International Journal of Graphs and CombinatoricsThe Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +1 more source
On the maximum atom-bond sum-connectivity index of graphs
Open MathematicsThe atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of edges adjacent
Alraqad Tariq +3 more
doaj +1 more source
New bounds on Zagreb connection indices for trees with fixed domination number
AKCE International Journal of Graphs and CombinatoricsA set D of vertices in a graph G is a dominating set of G if every vertex not in D is adjacent to a vertex in D. The domination number, [Formula: see text], is the minimum cardinality among all dominating sets of G.
H. Rahbani +2 more
doaj +1 more source
On the vv-degree based first Zagreb index of graphs
AKCE International Journal of Graphs and CombinatoricsA topological index is a graph invariant applicable in chemistry. The first Zagreb index is a topological index based on the vertex degrees of molecular graphs. For any graph G, the first Zagreb index [Formula: see text] is equal to the sum of squares of
L. Anusha +2 more
doaj +1 more source