Results 21 to 30 of about 56 (56)

On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees

Journal of Mathematics, Volume 2025, Issue 1, 2025.
Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif, Akhlaq A. Bhatti, Hicham Saber, Adel A. Attiya, Akbar Ali, Guo Zhong   +5 more
wiley   +1 more source

On the Multiplicative Sum Zagreb Index of Molecular Trees With Given Order and Number of Branching Vertices

Journal of Mathematics, Volume 2025, Issue 1, 2025.
The multiplicative sum Zagreb index of a graph G is defined as the product of the sum of the degrees of adjacent vertices of G. A molecular tree is an acyclic connected graph with maximum degree at most 4. A vertex in a molecular tree with degree 3 or 4 is referred to as a branching vertex. In this paper, we consider the class of all molecular trees of
Sadia Noureen, Mubashar Abbas, Abdulaziz Mutlaq Alotaibi, Jaya Percival Mazorodze, Taher S. Hassan, Akbar Ali, Zafar Ullah   +6 more
wiley   +1 more source

Leap Zagreb indices of certain chemical structures: a topological analysis

Main Group Metal Chemistry
Topological indices serve as important molecular descriptors in quantitative structure–property relationship (QSPR) and quantitative structure–activity relationship (QSAR) studies.
Rehman Masood Ur, Cai Gaixiang, Iqbal Javaria, Salman Muhammad   +3 more
doaj   +1 more source

On the maximum atom-bond sum-connectivity index of molecular trees

AKCE International Journal of Graphs and Combinatorics
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 vertex a.
Zhonglin Cheng, Akbar Jahanbani, Jun Wang   +2 more
doaj   +1 more source

On the spectral radius and energy of the degree distance matrix of a connected graph

Open Mathematics
Let GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj   +1 more source

New bounds on Zagreb connection indices for trees with fixed domination number

AKCE International Journal of Graphs and Combinatorics
A 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, H. Abdollahzadeh Ahangar, Michael A. Henning   +2 more
doaj   +1 more source

Upper bounds for the global cyclicity index

Open Mathematics
We find new upper bounds for the global cyclicity index, a variant of the Kirchhoff index, and discuss the wide family of graphs for which the bounds are attained.
Palacios José Luis
doaj   +1 more source

Further study of eccentricity based indices for benzenoid hourglass network. [PDF]

Heliyon, 2023
Iqbal H, Aftab MH, Akgul A, Mufti ZS, Yaqoob I, Bayram M, Riaz MB.   +6 more
europepmc   +1 more source

A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. [PDF]

Algorithms Mol Biol, 2021
Azam NA, Zhu J, Sun Y, Shi Y, Shurbevski A, Zhao L, Nagamochi H, Akutsu T.   +7 more
europepmc   +1 more source

Harary index of the zero divisor graph of upper triangular matrices. [PDF]

Sci Rep
Alshanqiti O, Sharma S, Bhat VK.
europepmc   +1 more source