نتایج جستجو برای: vertex co pi indices

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

2014
Mikhail Goubko

We derive sharp lower bounds for the first and the second Zagreb indices (M1 and M2 respectively) for trees and chemical trees with the given number of pendent vertices and find optimal trees. M1 is minimized by a tree with all internal vertices having degree 4, while M2 is minimized by a tree where each “stem” vertex is incident to 3 or 4 pendent vertices and one internal vertex, while the res...

2017
Ramin Kazemi Ali Behtoei

The rst Zagreb index of a graph is equal to the sum of the square of the vertex degrees of the graph and the forgotten topological index (Findex) of a graph is de ned as the sum of cubes of the vertex degrees of the graph. These parameters have applications in chemistry and drug structures. For any xed integer d ≥ 2, the d-ary tree is a rooted tree in which each node has no more than d children...

ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎t...

Journal: :Discrete Applied Mathematics 1995
Patrick Solé

Expanding parameters of graphs (magnification constant, edge and vertex cutset expansion) are related by very simple inequalities to forwarding parameters (edge and vertex forwarding indices). This shows that certain graphs have eccentricity close to the diameter. Connections between the forwarding indices and algebraic parameters like the smallest eigenvalue of the Laplacian or the genus of th...

Journal: :Mathematical and Computer Modelling 2011
Rundan Xing Bo Zhou

The hyper-Kirchhoff index is introduced when the hyper-Wiener operator is applied to the resistance-distance matrix of a connected graph. We give lower and upper bounds for the hyper-Kirchhoff index, and determine the n-vertex unicyclic graphs with the smallest, the second and the third smallest as well as the largest, the second and the third largest hyper-Kirchhoff indices for n ≥ 5. We also ...

Journal: :European Physical Journal C 2021

In the present work, we investigate decays of $B^{0}_{s} \rightarrow \phi\pi^{+}\pi^{-}$ and $B^{0} with final state interactions based on chiral unitary approach. $\pi^+\pi^-$ its coupled channels, study effects $\eta\eta$ channel in two-body for reproduction $f_{0}(980)$ state. Our results invariant mass distributions decay describe experimental data up to 1 GeV well, resonance contributions ...

2008
ETHAN D. BLOCH

In a 1967 paper, Banchoff described a theory of critical points and curvature for polyhedra embedded in Euclidean space. For each convex cell complex K in Rn, and for each linear map h : Rn ! R satisfying a simple generality criterion, he defined an index for each vertex of K with respect to the map h, and showed that these indices satisfy two properties: (1) for each map h, the sum of the indi...

Journal: :Circulation 2003
Titus Kuehne Maythem Saeed Kelly Gleason Daniel Turner David Teitel Charles B Higgins Phillip Moore

BACKGROUND This study was conducted to determine the effects of chronic pulmonary insufficiency (PI) on right (RV) and left (LV) ventricular function in young growing swine. METHODS AND RESULTS Six PI and 5 control animals were studied. PI was induced by transcatheter placement of stents across the pulmonary valve. Indices of systolic function (ejection fraction, cardiac output, and cardiac f...

2008
H. YOUSEFI-AZARI A. R. ASHRAFI M. H. KHALIFEH

The Wiener index of a graph G is defined as W(G) = 1/2∑{x,y}⊆V(G)d(x,y), where V(G) is the set of all vertices of G and for x,y ∈ V(G), d(x,y) denotes the length of a minimal path between x and y. In this paper, we first report our recent results on computing Wiener, PI and Balaban indices of some nanotubes and nanotori. Next, the PI and Szeged indices of a new type of nanostar dendrimers are c...

Journal: :Comput. Geom. 1998
János Pach

Let P1, P2, . . . , Pd+1 be pairwise disjoint n-element point sets in general position in d-space. It is shown that there exist a point O and suitable subsets Qi ⊆ Pi (i = 1, 2, . . . , d + 1) such that |Qi| ≥ cd|Pi|, and every d-dimensional simplex with exactly one vertex in each Qi contains O in its interior. Here cd is a positive constant depending only on d.

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

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