Results 251 to 260 of about 3,626 (270)

Atom–bond connectivity index of quasi-tree graphs

Rendiconti del Circolo Matematico di Palermo (1952 -), 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dehghan-Zadeh, T., Ashrafi, A. R.
openaire   +2 more sources

Atom-Bond Connectivity Index in Various Graphs

ECS Transactions, 2022
A topological index, furthermore identified by way of connective index, is a molecular construction descriptor intended from a molecular graph of a chemical composite, which symbolizes its topology. Different topological indices remain branded established on their degree, spectrum, and distance.
M Abirami, Y.J Ganesh, K Kalaivani
openaire   +1 more source

A Note on atom bond connectivity index

2012
The atom bond connectivity index of a graph is a new topological index was defined by E. Estrada as ABC(G)  uvE (dG(u) dG(v) 2) / dG(u)dG(v) , where G d ( u ) denotes degree of vertex u. In this paper we present some bounds of this new topological index.
HEIDARI RAD, S., KHAKI, A.
openaire   +1 more source

A Variant of Atom Bond Sum Connectivity Index

Match Communications in Mathematical and in Computer Chemistry
Summary: Topological index is a numerical graph invariant derived from molecular graph. The atom bond sum connectivity index drew a lot of interest from chemical graph theorists in a short period of time. Nowadays, the degree sum of a vertex's first neighbors is recognized as a useful parameter in chemical graph theory. Keeping these two facts in mind,
Yasin H, Mohammed, M, Suresh, Mondal, Sourav   +2 more
openaire   +1 more source

On Second Atom-Bond Connectivity Index

2013
The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G)  uvE (G ) (du dv  2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv.
ROSTAMI, M., SOHRABI-HAGHIGHAT, M., GHORBANI, M.   +2 more
openaire   +1 more source

On generalized atom-bond connectivity index of cacti

2019
Summary: The generalized atom-bond connectivity index of a graph \(G\) is denoted by ABC\(_a(G)\) and defined as the sum of weights \(\left(\frac{d(u)+d(v)-2}{d(u)d(v)}\right)^\alpha\) over all edges \(uv \in G\), where \(d(u)\) is the degree of the vertex \(u\) in \(G\), and \(\alpha\) is an arbitrary non-zero real number. A cactus is a graph in which
openaire   +1 more source

Bounds for the Atom-Bond Sum-Connectivity Index of Graphs

Match Communications in Mathematical and in Computer Chemistry
Summary: The \textit{atom-bond sum-connectivity} \((ABSC)\) index of a graph \(G\) is defined as \(ABSC(G)=\sum\limits_{uv\in E(G)}\sqrt\frac{d_u +d_v -2}{d_u +d_v}\), where \(d_u\) and \(d_v\) represent the degrees of \(u\) and \(v\) in \(G\), respectively.
Hussain, Zaryab, Liu, Hechao, Hua, Hongbo   +2 more
openaire   +1 more source

Remarks on atom bond connectivity index

2012
A topological index is a function Top from Σ into real numbers with this property that Top(G) = Top(H), if G and H are isomorphic. Nowadays, many of topological indices were defined for different purposes. In the present paper we present some properties of atom bond connectivity index.
openaire   +1 more source

Comparison between first geometric–arithmetic index and atom-bond connectivity index

Chemical Physics Letters, 2010
The first geometric-arithmetic index (GA) [1] and atom-bond connectivity index (ABC) [2] that are recently introduced, are found to be useful tools in QSPR and QSAR studies. In this letter we compare the GA and ABC indices for chemical trees and molecular graphs. Moreover, we also compare these two indices for general graphs. (C) 2010 Elsevier B.V. All
Das, Kinkar Ch., Trinajstić, Nenad
openaire   +1 more source

Atom-Bond Connectivity Index and Arithmetic-Geometric Index: Bounding Relationships

International Journal of Mathematics and Computer Science
In this paper, we establish extremal results and bounds of the atom-bond connectivity index with the arithmetic-geometric index given the minimum and maximum degrees of a graph. We have shown that regular graphs correspond to extremal graphs.
Abdulwahid, Fabricia M., Villarta, Cerina A., Mohammad, Nurijam Hanna M., Fabillar, Edwin B.   +3 more
openaire   +2 more sources