نتایج جستجو برای: wiener index w
تعداد نتایج: 594664 فیلتر نتایج به سال:
two sides of the edge e, and where the summation goes over all edges of T . The λ -modified Wiener index is defined as Wλ (T ) = ∑ e [nT,1(e) · nT,2(e)] . For each λ > 0 and each integer d with 3 ≤ d ≤ n− 2, we determine the trees with minimal λ -modified Wiener indices in the class of trees with n vertices and diameter d. The reverse Wiener index of a tree T with n vertices is defined as Λ (T)...
The Wiener index of a graph G, denoted by W (G), is the sum of distances between all pairs of vertices in G. In this paper, we consider the relation between the Wiener index of a graph, G, and its line graph, L(G). We show that if G is of minimum degree at least two, then W (G) ≤ W (L(G)). We prove that for every non-negative integer g0, there exists g > g0, such that there are infinitely many ...
Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index Sz(G) and the Wiener index W (G) of a connected bipartite graph G with n ≥ 4 vertices and m ≥ n edges, obeys the relation Sz(G) − W (G) ≥ 4n − 8. Moreover, this bound would be the best possible. This paper offers a proof to this conjecture.
Let (G,w) be a network, that is, a graph G = (V (G), E(G)) together with the weight function w : E(G) → R. The Szeged index Sz(G,w) of the network (G,w) is introduced and proved that Sz(G,w) ≥ W (G,w) holds for any connected network where W (G,w) is the Wiener index of (G,w). Moreover, equality holds if and only if (G,w) is a block network in which w is constant on each of its blocks. Analogous...
Let G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as WW(G)=12W(G)+12@?"{"u","v"}"@?"V"("G")d (u,v)^2. In this paper the hyper-Wiener indices of the Cartesian product, composition,...
We prove a conjecture of Nadjafi-Arani et al. on the difference between the Szeged and the Wiener index of a graph (M. J. Nadjafi-Arani, H. Khodashenas, A. R. Ashrafi: Graphs whose Szeged and Wiener numbers differ by 4 and 5, Math. Comput. Modelling 55 (2012), 1644–1648). Namely, if G is a 2-connected non-complete graph on n vertices, then Sz (G) −W (G) ≥ 2n − 6. Furthermore, the equality is ob...
Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...
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...
Let G be a graph with vertex set V(G) and edge set E(G). For any two vertices x and y in V(G), the distance between x and y, denoted by d(x,y), is the length of the shortest path connecting x and y. The degree of a vertex v in G is the number of neighbors of v in G. Numbers reflecting certain structural features of organic molecules that are obtained from the molecular graph are usually called ...
Let G be a graph. The Wiener index of G, W (G), is defined as the sum of distances between all pairs of vertices of G. Denote by L i (G) its i-iterated line graph. In the talk, we will consider the equation W (L i (T)) = W (T) where T is a tree and i ≥ 1.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید