نتایج جستجو برای: leap zagreb index

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

2016
T. Mansour M. A. Rostami E. Suresh G. B. A. Xavier

The edge version of traditional first Zagreb index is known as first reformulated Zagreb index. In this paper, we analyze and compare various lower and upper bounds for the first reformulated Zagreb index and we propose new lower and upper bounds which are stronger than the existing and recent results [Appl. Math. Comp. 273 (2016) 16-20]. In addition, we prove that our bounds are superior in co...

2015
MAHDIEH AZARI ALI IRANMANESH M. AZARI A. IRANMANESH

The multiplicative sum Zagreb index is defined for a simple graph G as the product of the terms dG(u)+dG(v) over all edges uv∈E(G) , where dG(u) denotes the degree of the vertex u of G . In this paper, we present some lower bounds for the multiplicative sum Zagreb index of several graph operations such as union, join, corona product, composition, direct product, Cartesian product and strong pro...

2017
Muhammad Imran Shakila Baby Hafiz Muhammad Afzal Siddiqui Muhammad Kashif Shafiq

Topological indices are the mathematical tools that correlate the chemical structure with various physical properties, chemical reactivity or biological activity numerically. A topological index is a function having a set of graphs as its domain and a set of real numbers as its range. In QSAR/QSPR study, a prediction about the bioactivity of chemical compounds is made on the basis of physico-ch...

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].

Journal: :communication in combinatorics and optimization 0
mehdi eliasi dept. of mathematics, khansar faculty of mathematics and computer science, khansar, iran, ali ghalavand dept. of mathematics, khansar faculty of mathematics and computer science, khansar, iran

for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...

The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.

Journal: :iranian journal of mathematical chemistry 2010
m. ghorbani m. songhori

wiener index is a topological index based on distance between every pair of vertices in agraph g. it was introduced in 1947 by one of the pioneer of this area e.g, harold wiener. inthe present paper, by using a new method introduced by klavžar we compute the wiener andszeged indices of some nanostar dendrimers.

2012
Kexiang Xu Kinkar Ch. Das

For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as M1(G) = ∑ v∈V (G) dG(v) 2 where dG(v) is the degree of vertex v in G. The alternative expression for M1(G) is ∑ uv∈E(G)(dG(u)+dG(v)). Very recently, Eliasi, Iranmanesh and Gutman [7] introduced a new graphical invariant ∏∗ 1(G) = ∏ uv∈E(G)(dG(u) + dG(v)) as the multiplicative version of ...

2012
Hongbo Hua Shenggui Zhang

For a nontrivial graph G, its first Zagreb coindex is defined as the sum of degree sum over all non-adjacent vertex pairs in G and the second Zagreb coindex is defined as the sum of degree product over all non-adjacent vertex pairs in G. Till now, established results concerning Zagreb coindices are mainly related to composite graphs and extremal values of some special graphs. The existing liter...

Journal: :iranian journal of mathematical chemistry 2012
t. doslic

zagreb indices belong to better known and better researched topological indices. weinvestigate here their ability to discriminate among benzenoid graphs and arrive at some quiteunexpected conclusions. along the way we establish tight (and sometimes sharp) lower andupper bounds on various classes of benzenoids.

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

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