نتایج جستجو برای: steiner wiener index

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

Journal: :iranian journal of mathematical chemistry 2011
ch. eslahchi s. alikhani m. h. akhbari

let g be a simple graph. the hosoya polynomial of g is ( , ) ,( , ) = { , } ( ) xd u v h g x  u v v gwhere d(u,v) denotes the distance between vertices u and v . the dendrimer nanostar is apart of a new group of macromolecules. in this paper we compute the hosoya polynomial foran infinite family of dendrimer nanostar. as a consequence we obtain the wiener index andthe hyper-wiener index of th...

Journal: :iranian journal of mathematical chemistry 2016
m. azari

the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...

A GRAOVAC D. VUKIČEVIĆ F. CATALDO O. ORI

This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...

Journal: :transactions on combinatorics 2014
jaisankar senbagamalar jayapal baskar babujee ivan gutman

let $g$ be an $(n,m)$-graph. we say that $g$ has property $(ast)$if for every pair of its adjacent vertices $x$ and $y$, thereexists a vertex $z$, such that $z$ is not adjacentto either $x$ or $y$. if the graph $g$ has property $(ast)$, thenits complement $overline g$ is connected, has diameter 2, and itswiener index is equal to $binom{n}{2}+m$, i.e., the wiener indexis insensitive of any other...

Journal: :Discussiones Mathematicae Graph Theory 2010
Rangaswami Balakrishnan S. Francis Raj

The Wiener number of a graph G is defined as 1 2 ∑ u,v∈V (G) d(u, v), d the distance function on G. The Wiener number has important applications in chemistry. We determine a formula for the Wiener number of an important graph family, namely, the Mycielskians μ(G) of graphs G. Using this, we show that for k ≥ 1, W (μ(S n)) ≤ W (μ(T k n )) ≤ W (μ(P k n )), where Sn, Tn and Pn denote a star, a gen...

Journal: :Discussiones Mathematicae Graph Theory 2008
Rangaswami Balakrishnan S. Francis Raj

The Wiener number of a graph G is defined as 1 2 ∑ d(u, v), where u, v ∈ V (G), and d is the distance function on G. The Wiener number has important applications in chemistry. We determine the Wiener number of an important family of graphs, namely, the Kneser graphs.

2006
Weigen Yan Yeong-Nan Yeh

Let T be an acyclic molecule with n vertices, and let S(T ) be the acyclic molecule obtained from T by replacing each edge of T by a path of length two. In this work, we show that the Wiener index of T can be explained as the number of matchings with n− 2 edges in S(T ). Furthermore, some related results are also obtained.

Ante Graovac, Franco Cataldo, Ottorino Ori, Tomislav Doslic,

We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...

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

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