Results 21 to 30 of about 217,223 (279)

General sum-connectivity index of trees with given number of branching vertices [PDF]

open access: yesTransactions on Combinatorics, 2023
In 2015, Borovi\'{c}anin presented trees with the smallest first Zagreb index among trees with given number of vertices and number of branching vertices. The first Zagreb index is obtained from the general sum-connectivity index if $a = 1$.
Tomas Vetrik
doaj   +1 more source

On Certain Aspects of Topological Indices

open access: yesJournal 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   +4 more
doaj   +1 more source

Mesoscale mapping of sediment source hotspots for dam sediment management in data-sparse semi-arid catchments [PDF]

open access: yes, 2020
Land degradation and water availability in semi-arid regions are interdependent challenges for management that are influenced by climatic and anthropogenic changes.
Gholami, Faraz Rabei   +5 more
core   +1 more source

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

open access: yesJournal 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   +5 more
doaj   +1 more source

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

open access: yes, 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   +17 more
core   +1 more source

On the sum-connectivity index

open access: yesFilomat, 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   +2 more
openaire   +3 more sources

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

open access: yesJournal 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   +3 more
doaj   +1 more source

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

open access: yesIEEE 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   +3 more
doaj   +1 more source

On Eccentric Connectivity Index of Eccentric Graph of Regular Dendrimer [PDF]

open access: yes, 2016
The eccentric connectivity index \(\xi ^c(G)\) of a connected graph G is defined as \(\xi ^c(G) =\sum _{v \in V(G)}{deg(v) e(v)},\) where deg( v) is the degree of vertex v and e( v) is the eccentricity of v. The eccentric graph, \(G_e\), of a graph G has
Nagar, Atulya, Sastha, Sriram
core   +2 more sources

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

open access: yesAl-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

Home - About - Disclaimer - Privacy