Results 11 to 20 of about 4,436,056 (266)

General sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graph of subdivision graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
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

On the maximum atom-bond sum-connectivity index of graphs [PDF]

open access: yesOpen Mathematics
The atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of edges adjacent
Alraqad Tariq   +3 more
doaj   +6 more sources

A note on general sum-connectivity index

open access: yesProyecciones (Antofagasta), 2023
For a simple finite graph G, general sum-connectivity index is defined for any real number α as χα(G) =  , which generalises both the first Zagreb index and the ordinary sum-connectivity index. In this paper, we present some new bounds for the general sum-connectivity index. We also present relation between general sum-connectivity index and general
Phanjoubam, Chinglensana   +2 more
openaire   +3 more sources

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   +4 more sources

On the maximum atom-bond sum-connectivity index of molecular trees

open access: yesAKCE International Journal of Graphs and Combinatorics
Let G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the vertex a.
Zhonglin Cheng   +2 more
doaj   +4 more sources

Sharp Lower Bounds of the Sum-Connectivity Index of Unicyclic Graphs

open access: yesJournal of Mathematics, 2021
The sum-connectivity index of a graph G is defined as the sum of weights 1/du+dv over all edges uv of G, where du and dv are the degrees of the vertices u and v in graph G, respectively.
Maryam Atapour
doaj   +2 more sources

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   +2 more sources

Investigation of General Power Sum-Connectivity Index for Some Classes of Extremal Graphs

open access: yesComplexity, 2021
In this work, we introduce a new topological index called a general power sum-connectivity index and we discuss this graph invariant for some classes of extremal graphs.
Rui Cheng   +5 more
doaj   +2 more sources

Eccentric connectivity index and eccentric distance sum of some graph operations [PDF]

open access: yesTransactions on Combinatorics, 2013
Let $G=(V,E)$ be a connected graph. The eccentric connectivity index of $G$, $xi^{c}(G)$, is defined as $xi^{c}(G)=sum_{vin V(G)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. The eccentric distance sum of $G$
Buzohragul Eskender, Elkin Vumar
doaj   +1 more source

Optimization of General Power-Sum Connectivity Index in Uni-Cyclic Graphs, Bi-Cyclic Graphs and Trees by Means of Operations

open access: yesAxioms
The field of indices has been explored and advanced by various researchers for different purposes. One purpose is the optimization of indices in various problems. In this work, the general power-sum connectivity index is considered. The general power-sum
Muhammad Yasin Khan   +2 more
doaj   +2 more sources

Home - About - Disclaimer - Privacy