Results 21 to 30 of about 217,897 (268)

Wiener Index and Remoteness in Triangulations and Quadrangulations

, 2021
Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and quadrangulations with ...
Czabarka, Éva, Dankelmann, Peter, Olsen, Trevor, Székely, László A.   +3 more
core   +1 more source

On Certain Aspects of Topological Indices

Journal of Mathematics, 2021
A topological index, also known as connectivity index, is a molecular structure descriptor calculated from a molecular graph of a chemical compound which characterizes its topology.
Tanweer Ul Islam, Zeeshan Saleem Mufti, Aqsa Ameen, Muhammad Nauman Aslam, Ali Tabraiz   +4 more
doaj   +1 more source

On the Graphs of Minimum Degree At Least 3 Having Minimum Sum-Connectivity Index

Journal of Mathematics, 2022
For a graph G, its sum-connectivity index is denoted by χG and is defined as the sum of the numbers du+dv−1/2 over all edges uv of G, where dw denotes the degree of a vertex w∈VG.
Wael W. Mohammed, Shahzad Ahmed, Zahid Raza, Jia-Bao Liu, Farooq Ahmad, Elsayed M. Elsayed   +5 more
doaj   +1 more source

On the general atom-bond sum-connectivity index

AIMS Mathematics, 2023
<abstract><p>This paper is concerned with a generalization of the atom-bond sum-connectivity (ABS) index, devised recently in [A. Ali, B. Furtula, I. Redžepović, I. Gutman, Atom-bond sum-connectivity index, <italic>J. Math. Chem.</italic>, <bold>60</bold> (2022), 2081-2093].
Abeer M. Albalahi, Zhibin Du, Akbar Ali
openaire   +2 more sources

Influence of wiring cost on the large-scale architecture of human cortical connectivity [PDF]

, 2014
In the past two decades some fundamental properties of cortical connectivity have been discovered: small-world structure, pronounced hierarchical and modular organisation, and strong core and rich-club structures.
A Fornito, A Zalesky, AK Seth, AL Traud, Anil K. Seth, B Karrer, BJ Baars, C Echtermeyer, C Koch, CC Hilgetag, CJ Honey, CJ Stam, D Bhowmik, D Holten, D Meunier, D Meunier, D Tomasi, D Tomasi, David Samu, DB Chklovskii, DC Van Essen, DJ Watts, DS Bassett, DS Bassett, DS Bassett, DS Modha, E Bullmore, E Ravasz, FD Rossa, G Tononi, G Zamora-López, G Zamora-López, H Johansen-Berg, H Pan, J Cabral, J Gómez-Gardeñes, JP Onnela, L Cammoun, L Danon, M Arthuis, M Kaiser, M Kaiser, M Kaiser, M Kaiser, M Kaiser, M Meila, M Rubinov, M Rubinov, M Shanahan, M Shanahan, M Shanahan, M Shanahan, M Steen, M Valencia, MD Greicius, MD Humphries, MD Humphries, ME Newman, ME Newman, ME Raichle, MEJ Newman, MEJ Newman, MG Kitzbichler, MP Van den Heuvel, MP van den Heuvel, O Sporns, O Sporns, O Sporns, O Sporns, O Sporns, O Sporns, O Sporns, O Sporns, O Sporns, O Sporns, Olaf Sporns, P Hagmann, R Milo, S Achard, S Boccaletti, S Jbabdi, S Maslov, S Mori, S Zhou, SB Seidman, SL Bressler, SP Borgatti, T Opsahl, T Sørensen, TE Conturo, Thomas Nowotny, V Colizza, V Latora, Y Chen, Y He, YY Ahn, ZJ Chen   +96 more
core   +7 more sources

The Connectivity and the Harary Index of a Graph [PDF]

, 2012
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.
Das, Diudea, Estrada, Feng, He, Ilić, Ivanciuc, Lučić, Plavčsić, Wiener, Xiao-Xin Li, Xu, Xu, Xu, Xu, Yi-Zheng Fan, Yu, Zhou   +17 more
core   +1 more source

On the Computation of Some Topological Descriptors to Find Closed Formulas for Certain Chemical Graphs

Journal of Chemistry, 2021
In this research paper, we will compute the topological indices (degree based) such as the ordinary generalized geometric-arithmetic (OGA) index, first and second Gourava indices, first and second hyper-Gourava indices, general Randic´ index RγG,for γ=±1,
Muhammad Haroon Aftab, Muhammad Rafaqat, M. Hussain, Tariq Zia   +3 more
doaj   +1 more source

On the sum-connectivity index

Filomat, 2011
The sum-connectivity index of a simple graph G is defined in mathematical chemistry as R+(G) = ? uv?E(G)(du+dv)?1/2, where E(G) is the edge set of G and du is the degree of vertex u in G. We give a best possible lower bound for the sum-connectivity index of a graph (a triangle-free graph, respectively) with n vertices and minimum degree at ...
Wang, Shilin, Zhou, Bo, Trinajstić, Nenad   +2 more
openaire   +3 more sources

Exact Formula and Improved Bounds for General Sum-Connectivity Index of Graph-Operations

IEEE Access, 2019
For a molecular graph Γ, the general sum-connectivity index is defined as χβ(Γ) = Σvw∈E(Γ)[dΓ(v) + dΓ(w)]β, where β ∈ R and dΓ(v) denotes the degree of the vertex ...
Maqsood Ahmad, Muhammad Saeed, Muhammad Javaid, Muhammad Hussain   +3 more
doaj   +1 more source

Analysis of the properties of the topological Index using (analysis tools)

Al-Kitab Journal for Pure Sciences, 2023
Graph G has two sets of information: the vertices, V(G), and the edges, E(G). The definitions for the Connectivity, Geometric Arithmetic, Atomic Bond, and Sum Connectivity Indices of G: were deg(u), deg(v) are a degree of vertices. Dendrimers are
Batool Hatawi, Nabil Aref
doaj   +1 more source