نتایج جستجو برای: edge wiener index
تعداد نتایج: 511127 فیلتر نتایج به سال:
A simpliied way of deriving of realizable and explicit Wiener lters is presented. Discrete time problems are discussed, in a polynomial equation framework. Optimal lters, predictors and smoothers are calculated by means of spectral factorizations and linear polynomial equations. A new tool for obtaining these equations, for a given problem structure, is described. It is based on evaluation of o...
Let G be a molecular graph. The Wiener index of G is defined as the summation of all distances between vertices of G. In this paper, an exact formula for the Wiener index of a new type of nanostar dendrimer is given.
The Wiener Index, or the Wiener Number, also known as the “sum of distances” of a connected graph, is one of the quantities associated with a molecular graph that correlates nicely to physical and chemical properties, and has been studied in depth. An index proposed by Schultz is shown to be related to the Wiener Index for trees, and Ivan Gutman proposed a modification of the Schultz index with...
let g be a simple connected graph. the generalized polarity wiener index ofg is defined as the number of unordered pairs of vertices of g whosedistance is k. some formulas are obtained for computing the generalizedpolarity wiener index of the cartesian product and the tensor product ofgraphs in this article.
The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.
the edge detour index polynomials were recently introduced for computing theedge detour indices. in this paper we nd relations among edge detour polynomials for the2-dimensional graph of tuc4c8(s) in a euclidean plane and tuc4c8(s) nanotorus.
The sum of distances between all pairs of vertices W (G) in a connected graph G as a graph invariant was first introduced by Wiener [9] in 1947. He observed a correlation between boiling points of paraffins and this invariant, which has later become known as Wiener index of a graph. Today, the Wiener index is one of the most widely used descriptors in chemical graph theory. Due to its strong co...
The Wiener index is one of the oldest graph parameter which is used to study molecular-graph-based structure. This parameter was first proposed by Harold Wiener in 1947 to determining the boiling point of paraffin. The Wiener index of a molecular graph measures the compactness of the underlying molecule. This parameter is wide studied area for molecular chemistry. It is used to study the physio...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید