Results 1 to 10 of about 4,100,336 (288)
The general sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graphs of subdivision graphs of tadpole graphs, wheels and ladders have been reported in the literature.
Harishchandra S. Ramane +2 more
doaj +4 more sources
The connectivity and the Harary index of a graph
The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with maximum Harary index among all graphs with given number of cut vertices or ...
Yi-Zheng Fan
exaly +5 more sources
On the eccentric connectivity index of a graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S Mukwembi
exaly +4 more sources
Atom–bond connectivity index of trees
The recently introduced atom-bond connectivity (ABC) index has been applied up to now to study the stability of alkanes and the strain energy of cycloalkanes. Here, mathematical properties of the ABC index of trees are studied. Chemical trees with the extremal ABC values are found. In addition, it has been proven that among all trees, the star tree, Sn,
Boris Furtula +2 more
exaly +3 more sources
On Eccentric Connectivity Index of TiO2 Nanotubes
The eccentric connectivity index (ECI) is a distance based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature.
Imran Nadeem, Hani Shaker
doaj +5 more sources
Comparison between the Szeged index and the eccentric connectivity index
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das
exaly +2 more sources
Wiener index and applications in the Neutrosophic graphs [PDF]
In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of the most important topological indices. This index is a distance-based index that is calculated based on the geodesic distance between two vertices.
Masoud Ghods, Zahra Rostami
doaj +1 more source
Choosing the exponent in the definition of the connectivity index [PDF]
Let δv denote the degree of the vertex v of a molecular graph G. Then the connectivity index of G is defined as C (λ) = G (λ,C) = Σ (δuδv)λ, where the summation goes over all pairs of adjacent vertices.
Gutman Ivan, Lepović Mirko
doaj +3 more sources
The Q-index and Connectivity of Graphs
A connected graph $G$ is said to be $k$-connected if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are deleted. In this paper, for a connected graph $G$ with sufficiently large order, we present a tight sufficient condition for $G$ with fixed minimum degree to be $k$-connected based on the $Q$-index.
Peng-Li Zhang +3 more
openaire +2 more sources
Two theorems on connectivity indices [PDF]
Two general cases are pointed out for which the ordering of molecules according to the connectivity index C(l) is the same for all values of the exponent l.
IVAN GUTMAN
doaj +3 more sources

