نتایج جستجو برای: randic index general sum connectivity index

تعداد نتایج: 1209035  

Journal: :Mathematical Problems in Engineering 2021

Sierpinski graphs are a widely observed family of fractal-type relevant to topology, Hanoi Tower mathematics, computer engineering, and around. Chemical implementations graph theory establish significant properties, such as chemical activity, physicochemical thermodynamic pharmacological activities molecular graph. Specific descriptors alluded topological indices helpful predict these propertie...

Journal: :iranian journal of mathematical chemistry 2010
t. došlić m. saheli d. vukičević

eccentric connectivity index has been found to have a low degeneracy and hence a significantpotential of predicting biological activity of certain classes of chemical compounds. wepresent here explicit formulas for eccentric connectivity index of various families of graphs.we also show that the eccentric connectivity index grows at most polynomially with thenumber of vertices and determine the ...

Journal: :Discrete Applied Mathematics 2015
Xiao-Xin Li Yi-Zheng Fan

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 paperweprovide anupper boundof theHarary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with themaximumHarary index among all graphs with a given number of cut vertices or vertex connectivity or edge connectivity. In ad...

Journal: :Discrete Applied Mathematics 2018
Akbar Ali Darko Dimitrov

Many existing degree based topological indices can be clasified as bond incident degree (BID) indices, whose general form is BID(G) = ∑ uv∈E(G) Ψ(du, dv), where uv is the edge connecting the vertices u, v of the graph G, E(G) is the edge set of G, du is the degree of the vertex u and Ψ is a non-negative real valued (symmetric) function of du and dv. Here, it has been proven that if the extensio...

Journal: :Discrete Applied Mathematics 2023

Let G be a nonempty simple graph with vertex set V(G) and an edge E(G). For every injective labeling f:V(G)?Z, there are two induced labelings, namely f+:E(G)?Z defined by f+(uv)=f(u)+f(v), f?:E(G)?Z f?(uv)=|f(u)?f(v)|. The sum index the difference minimum cardinalities of ranges f+ f?, respectively. We provide upper lower bounds on index, determine various families graphs. also interesting con...

Journal: :International Journal of Scientific Research in Mathematical and Statistical Sciences 2018

2017
Yasir Bashir Muhammad Rafiq Nargis Bibi

There is a natural linkage between the molecular structures and the bio-medical and pharmacology characteristics. A topological index can be considered as transformation of chemical structure in to real number and has been used as a predictor parameter. There are certain vertex-degree-based topological indices which has been used extensively in the chemical graph theory but recently no further ...

Journal: :International Letters of Chemistry, Physics and Astronomy 2015

Journal: :bulletin of the iranian mathematical society 0
a. ali department of mathematics, national university of computer and emerging sciences, b-block, faisal town, lahore, pakistan. a. bhatti department of mathematics, national university of computer and emerging sciences, b-block, faisal town, lahore, pakistan. z. raza department of mathematics, national university of computer and emerging sciences, b-block, faisal town, lahore, pakistan.and department of mathematics, college of sciences, university of sharjah, sharjah, united arab emirates.

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.

D. VUKIČEVIĆ M. SAHELI T. DOŠLIĆ

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 with the number of vertices and determine ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید