نتایج جستجو برای: eccentric connectivity index

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

Journal: :Australasian J. Combinatorics 1994
Roger C. Entringer Amram Meir John W. Moon László A. Székely

The Wiener index W( G) of a connected graph G is the sum of the distances d( u, v) between all pairs of vertices u and v of G. This index seems to have been introduced in [22] where it was shown that certain physical properties of various paraffin species are correlated with the Wiener index of the tree determined by the carbon atoms of the corresponding molecules. Canfield, Robinson, and Rouvr...

Journal: :Discrete Mathematics 2009
Peter Dankelmann Ivan Gutman Simon Mukwembi Henda C. Swart

If G is a connected graph, then the distance between two edges is, by definition, the distance between the corresponding vertices of the line graph of G. The edge-Wiener index We of G is then equal to the sum of distances between all pairs of edges of G. We give bounds on We in terms of order and size. In particular we prove the asymptotically sharp upper bound We(G) ≤ 25 55 n5 + O(n9/2) for gr...

2010
Liancui Zuo

For an edge uv of a graph G, the weight of the edge e = uv is denoted by w(e) = 1/ √ d(u)d(v). Then

2006
Mei LU Lianzhu ZHANG Feng TIAN

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))− 1 2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. In the paper, we give a sharp lower bound on the Randić index of cacti.

Journal: :Discrete Applied Mathematics 2006
Huiqing Liu Mei Lu Feng Tian

The connectivity index wα(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where α is a real number (α 6= 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1(T ). Also, for −1 ≤ α < 0, we give a sharp lower bound and a upper bound for wα(T ).

Journal: :Applied Mathematics and Computation 2015
Martin Knor Riste Skrekovski Aleksandra Tepeh

The Wiener index W (G) of a connected graph G is defined to be the sum

2002
Ljiljana Pavlović Ivan Gutman

Let G be a graph and δv the degree of its vertex v . The connectivity index of G is χ = ∑ (δu δv) −1/2 , with the summation ranging over all pairs of adjacent vertices of G . We offer a simple proof that (a) among n-vertex graphs without isolated vertices, the star has minimal χvalue, and (b) among n-vertex graphs, the graphs in which all components are regular of non–zero degree have maximal (...

Journal: :journal of research in medical sciences 0
shuxia wang kangxing song hao xue jingzhou chen yubao zou kai sun

background: the association of metabolic syndrome (ms) with left  ventricular (lv) hypertrophy is controversial. the objective of our study was to investigate the infl uence of ms on lv mass and geometry in community-based hypertensive patients among han chinese.materials and methods: this study included 1733 metabolic syndrome patients according to the international diabetes federation (idf) d...

2011
Bo Zhou Rundan Xing

The atom-bond connectivity (ABC) index, introduced by Estrada et al. in 1998, displays an excellent correlation with the formation heat of alkanes. We give upper bounds for this graph invariant using the number of vertices, the number of edges, the Randić connectivity indices, and the first Zagreb index. We determine the unique tree with the maximum ABC index among trees with given numbers of v...

2013
Rasaaq A. Adebayo Olaniyi J. Bamikole Michael O. Balogun Anthony O. Akintomide Victor O. Adeyeye Luqman A. Bisiriyu Tuoyo O. Mene-Afejuku Ebenezer A. Ajayi Olugbenga O. Abiodun

Left ventricular (LV) hypertrophy is an important predictor of morbidity and mortality in hypertensive patients, and its geometric pattern is a useful determinant of severity and prognosis of heart disease. Studies on LV geometric pattern involving large number of Nigerian hypertensive patients are limited. We examined the LV geometric pattern in hypertensive patients seen in our echocardiograp...

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

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