Results 231 to 240 of about 7,008 (268)
Some of the next articles are maybe not open access.

On Connected Graphs Having the Maximum Connective Eccentricity Index

Journal of Applied Mathematics and Computing, 2021
The connective eccentricity index (CEI) of a connected graph G is defined as $$\xi ^{ee}(G)=\sum _{u\in V_G}[d_G(u)/\varepsilon _G(u)]$$ , where $$d_G(u)$$ and
Shahid Zaman, Akbar Ali
openaire   +2 more sources

On Eccentric Connectivity Index and Connectivity

Acta Mathematica Sinica, English Series, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mukungunugwa, Vivian, Mukwembi, Simon
openaire   +1 more source

Inverse connective eccentricity index and its applications

2021
Summary: The inverse connective eccentricity index of a connected graph \(G\) is defined as \(\xi^{-1}_{ce}(G) = \sum\limits_{u\in V(G)}\frac{\epsilon_G(u)}{d_G(u)}\), where \(\epsilon_G(u)\) and \(d_G(u)\) are the eccentricity and degree of a vertex \(u\) in \(G\), respectively.
Pattabiraman, K, Suganya, T
openaire   +2 more sources

Eccentric connectivity index: extremal graphs and values

Iranian journal of mathemathical chemistry, 2010
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially
DOŠLIĆ, T.   +2 more
openaire   +3 more sources

On the maximum connective eccentricity index among k-connected graphs

Discrete Mathematics, Algorithms and Applications, 2020
The connective eccentricity index (CEI for short) of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the degree of [Formula: see text] and [Formula: see text] is the eccentricity of [Formula: see text] in [Formula: see text].
openaire   +1 more source

Connective eccentric index of fullerenes

2011
Fullerenes are carbon-cage molecules in which a number of carbon atoms are bonded in a nearly spherical configuration. The connective eccentric index of graph G is defined as C (G)= Σa V(G)deg(a)e(a) -1, where e(a) is defined as the length of a maximal path connecting a to another vertex of G.
openaire   +1 more source

Eccentric connectivity index of composite graphs

Utilitas mathematica, 2014
We present explicit formulas for the values of eccentric connectivity index for several families of composite graphs. The results are applied to some graphs of chemical interest, such as $C_4$ nanotubes and nanotori.
Došlić, Tomislav, Saheli, Mahboubeh
openaire   +2 more sources

The Modified Eccentric Connectivity Index of Nanocomposites

Journal of Computational and Theoretical Nanoscience, 2015
The modified eccentric connectivity index of a graph G is defined as xi(c)(G) = Sigma(v is an element of V(G)) delta(v)epsilon(G)(v), where epsilon(G)(V) is the eccentricity of vertex v and delta(v) is the sum of the degrees of its neighborhoods. In this paper, we investigate the modified eccentric connectivity index of a class of composite graphs ...
BERBERLER, MURAT ERŞEN   +1 more
openaire   +2 more sources

Eccentric connectivity index in complementary prisms

Discrete Mathematics, Algorithms and Applications
The topological index is just one of several very useful tools that graph theory has made available to chemists. Topological indices are invariants of real numbers under graph isomorphisms. Several topological indices have been defined. Some of them are used to model chemical, pharmaceutical and other properties of molecules.
Aysun Aytaç, Belgin Coşkun
openaire   +1 more source

Augmented Eccentric Connectivity Index of Grid Graphs

2016
We present explicit formulas for augmented eccentric connectivity indices of several classes of grid graphs that arise via Cartesian product. We also explore their asymptotic behavior and compute the compression ratios for considered graphs.
Tomislav Došlić, Mojgan Mogharrab
openaire   +2 more sources

Home - About - Disclaimer - Privacy