Results 31 to 40 of about 78 (66)
Topological 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
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
For 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
The minimum exponential atom-bond connectivity energy of trees
Let 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
On $ h $-integral Sombor indices [PDF]
In 2021, Ivan Gutman introduced the Sombor index, a new vertex-degree-based topological index with significant geometric meaning. This index has shown remarkable growth in research activity in recent years.
Edil D. Molina +2 more
core +1 more source
On the maximum atom-bond sum-connectivity index of molecular trees
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
On the spectral radius and energy of the degree distance matrix of a connected graph
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
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
Upper bounds for the global cyclicity index
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]
Iqbal H +7 more
europepmc +1 more source

