Results 21 to 30 of about 56 (56)

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

open access: yesOpen 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

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

open access: yesJournal 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   +6 more
wiley   +1 more source

Upper bounds for the global cyclicity index

open access: yesOpen 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

Predictive modeling of physical properties in silane compounds using topological descriptors: A computational approach

open access: yesMain Group Metal Chemistry
Silane compounds are a class of chemical compounds composed of silicon (Si) and hydrogen (H), characterized by the general formula SiH4−xRx{{\rm{SiH}}}_{4-x}{R}_{x}, where RR represents various organic groups. The simplest member of this family is silane
Zhang Xiujun   +4 more
doaj   +1 more source

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

open access: yesAKCE 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   +2 more
doaj   +1 more source

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

open access: yesAKCE 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   +2 more
doaj   +1 more source

Leap Zagreb indices of certain chemical structures: a topological analysis

open access: yesMain 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   +3 more
doaj   +1 more source

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

open access: yesHeliyon, 2023
Iqbal H   +7 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy